Changeset 1857:2e3a4481901e in lemon0.x
 Timestamp:
 12/10/05 20:38:53 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2425
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/belmann_ford.h
r1816 r1857 431 431 std::vector<Value> values(_process.size()); 432 432 for (int i = 0; i < (int)_process.size(); ++i) { 433 values[i] = _dist[_process[i]];433 values[i] = (*_dist)[_process[i]]; 434 434 } 435 435 for (int i = 0; i < (int)_process.size(); ++i) { … … 554 554 addSource(s); 555 555 start(); 556 } 557 558 /// \brief Runs %BelmannFord algorithm with limited path length 559 /// from node \c s. 560 /// 561 /// This method runs the %BelmannFord algorithm from a root node \c s 562 /// in order to compute the shortest path with at most \c len edges 563 /// to each node. The algorithm computes 564 ///  The shortest path tree. 565 ///  The distance of each node from the root. 566 /// 567 /// \note d.run(s, len) is just a shortcut of the following code. 568 /// \code 569 /// d.init(); 570 /// d.addSource(s); 571 /// d.limitedStart(len); 572 /// \endcode 573 void run(Node s, int len) { 574 init(); 575 addSource(s); 576 limitedStart(len); 556 577 } 557 578
Note: See TracChangeset
for help on using the changeset viewer.