Changeset 2362:eb37b9774ef6 in lemon-0.x
- Timestamp:
- 02/15/07 14:06:23 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3173
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bellman_ford.h
r2335 r2362 525 525 /// - The distance of each node from the root(s). 526 526 bool checkedStart() { 527 int num = countNodes(*graph) ;527 int num = countNodes(*graph) - 1; 528 528 for (int i = 0; i < num; ++i) { 529 529 if (processNextWeakRound()) return true; 530 530 } 531 return false;531 return _process.empty(); 532 532 } 533 533 … … 585 585 /// - The distance of each node from the root. 586 586 /// 587 /// \note d.run(s, len) is just a shortcut of the following code.587 /// \note d.run(s, num) is just a shortcut of the following code. 588 588 ///\code 589 589 /// d.init(); 590 590 /// d.addSource(s); 591 /// d.limitedStart( len);591 /// d.limitedStart(num); 592 592 ///\endcode 593 void run(Node s, int len) {593 void run(Node s, int num) { 594 594 init(); 595 595 addSource(s); 596 limitedStart( len);596 limitedStart(num); 597 597 } 598 598 … … 609 609 /// \brief Lemon iterator for get a active nodes. 610 610 /// 611 /// Lemon iterator for get aactive nodes. This class provides a611 /// Lemon iterator for get the active nodes. This class provides a 612 612 /// common style lemon iterator which gives back a subset of the 613 613 /// nodes. The iterated nodes are active in the algorithm after
Note: See TracChangeset
for help on using the changeset viewer.