Changeset 1816:19ee9133a28c in lemon0.x for lemon/belmann_ford.h
 Timestamp:
 11/18/05 12:13:11 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2363
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/belmann_ford.h
r1783 r1816 420 420 /// 421 421 /// If the algoritm calculated the distances in the previous round 422 /// strictly for all at most k length pathes then it will calculate the 423 /// distances strictly for all at most k + 1 length pathes. With k 424 /// iteration this function calculates the at most k length pathes. 422 /// strictly for all at most k length paths then it will calculate the 423 /// distances strictly for all at most k + 1 length paths. With k 424 /// iteration this function calculates the at most k length paths. 425 ///\todo what is the return value? 425 426 bool processNextRound() { 426 427 for (int i = 0; i < (int)_process.size(); ++i) { … … 453 454 /// 454 455 /// If the algorithm calculated the distances in the 455 /// previous round at least for all at most k length pathes then it will 456 /// calculate the distances at least for all at most k + 1 length pathes. 457 /// This function does not make possible to calculate strictly the 458 /// at most k length minimal pathes, this way it called just weak round. 456 /// previous round at least for all at most k length paths then it will 457 /// calculate the distances at least for all at most k + 1 length paths. 458 /// This function does not make it possible to calculate strictly the 459 /// at most k length minimal paths, this is why it is 460 /// called just weak round. 461 ///\todo what is the return value? 459 462 bool processNextWeakRound() { 460 463 for (int i = 0; i < (int)_process.size(); ++i) { … … 524 527 /// This method runs the %BelmannFord algorithm from the root node(s) 525 528 /// in order to compute the shortest path with at most \c length edge 526 /// long path es to each node. The algorithm computes529 /// long paths to each node. The algorithm computes 527 530 ///  The shortest path tree. 528 531 ///  The limited distance of each node from the root(s).
Note: See TracChangeset
for help on using the changeset viewer.