From b3b460cae294ccf31b013fbd8d198939afb6abef Mon Sep 17 00:00:00 2001 From: fonsinchen Date: Sat, 19 Oct 2013 17:15:19 +0000 Subject: (svn r25885) -Codechange: Keep paths sorted so that the ones with flow == 0 are in the back and don't have to be iterated over so often. --- src/linkgraph/linkgraphjob.h | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) (limited to 'src/linkgraph/linkgraphjob.h') diff --git a/src/linkgraph/linkgraphjob.h b/src/linkgraph/linkgraphjob.h index 79231c754..66aff3672 100644 --- a/src/linkgraph/linkgraphjob.h +++ b/src/linkgraph/linkgraphjob.h @@ -45,7 +45,7 @@ private: */ struct NodeAnnotation { uint undelivered_supply; ///< Amount of supply that hasn't been distributed yet. - PathList paths; ///< Paths through this node. + PathList paths; ///< Paths through this node, sorted so that those with flow == 0 are in the back. FlowStatMap flows; ///< Planned flows to other nodes. void Init(uint supply); }; @@ -234,7 +234,8 @@ public: const FlowStatMap &Flows() const { return this->node_anno.flows; } /** - * Get the paths this node is part of. + * Get the paths this node is part of. Paths are always expected to be + * sorted so that those with flow == 0 are in the back of the list. * @return Paths. */ PathList &Paths() { return this->node_anno.paths; } -- cgit v1.2.3-54-g00ecf