Changeset 2517:d9cfac072869 in lemon0.x for lemon/bellman_ford.h
 Timestamp:
 11/20/07 22:40:55 (12 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3393
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bellman_ford.h
r2476 r2517 436 436 /// the path. 437 437 /// 438 /// \return %True when the algorithm have not found more shorter438 /// \return \c true when the algorithm have not found more shorter 439 439 /// paths. 440 440 bool processNextRound() { … … 473 473 /// at most k length minimal paths, this is why it is 474 474 /// called just weak round. 475 /// \return %True when the algorithm have not found more shorter paths.475 /// \return \c true when the algorithm have not found more shorter paths. 476 476 bool processNextWeakRound() { 477 477 for (int i = 0; i < int(_process.size()); ++i) { … … 518 518 /// 519 519 /// \pre init() must be called and at least one node should be added 520 /// with addSource() before using this function. If there is 521 /// a negative cycle in the graph it gives back false. 520 /// with addSource() before using this function. 522 521 /// 523 522 /// This method runs the %BellmanFord algorithm from the root node(s) … … 526 525 ///  The shortest path tree. 527 526 ///  The distance of each node from the root(s). 527 /// 528 /// \return \c false if there is a negative cycle in the graph. 528 529 bool checkedStart() { 529 530 int num = countNodes(*graph);
Note: See TracChangeset
for help on using the changeset viewer.