Changeset 1754:4bf5ceb49023 in lemon0.x for lemon/belmann_ford.h
 Timestamp:
 11/02/05 16:27:38 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2283
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/belmann_ford.h
r1741 r1754 142 142 }; 143 143 144 /// \brief BelmannFord algorithm class.144 /// \brief %BelmannFord algorithm class. 145 145 /// 146 146 /// \ingroup flowalgs … … 152 152 /// The BelmannFord algorithm solves the shortest path from one node 153 153 /// problem when the edges can have negative length but the graph should 154 /// not contain c irclewith negative sum of length. If we can assume154 /// not contain cycles with negative sum of length. If we can assume 155 155 /// that all edge is nonnegative in the graph then the dijkstra algorithm 156 156 /// should be used rather. … … 429 429 } 430 430 431 /// \brief Executes the algorithm and checks the negative c ircles.431 /// \brief Executes the algorithm and checks the negative cycles. 432 432 /// 433 433 /// \pre init() must be called and at least one node should be added 434 434 /// with addSource() before using this function. If there is 435 /// a negative c irclein the graph it gives back false.435 /// a negative cycles in the graph it gives back false. 436 436 /// 437 437 /// This method runs the %BelmannFord algorithm from the root node(s)
Note: See TracChangeset
for help on using the changeset viewer.