Changeset 1816:19ee9133a28c in lemon-0.x

Ignore:
Timestamp:
11/18/05 12:13:11 (14 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2363
Message:
• Spellcheck (pathes->paths)
• todos
File:
1 edited

Unmodified
Removed
• lemon/belmann_ford.h

 r1783 /// /// If the algoritm calculated the distances in the previous round /// strictly for all at most k length pathes then it will calculate the /// distances strictly for all at most k + 1 length pathes. With k /// iteration this function calculates the at most k length pathes. /// strictly for all at most k length paths then it will calculate the /// distances strictly for all at most k + 1 length paths. With k /// iteration this function calculates the at most k length paths. ///\todo what is the return value? bool processNextRound() { for (int i = 0; i < (int)_process.size(); ++i) { /// /// If the algorithm calculated the distances in the /// previous round at least for all at most k length pathes then it will /// calculate the distances at least for all at most k + 1 length pathes. /// This function does not make possible to calculate strictly the /// at most k length minimal pathes, this way it called just weak round. /// previous round at least for all at most k length paths then it will /// calculate the distances at least for all at most k + 1 length paths. /// This function does not make it possible to calculate strictly the /// at most k length minimal paths, this is why it is /// called just weak round. ///\todo what is the return value? bool processNextWeakRound() { for (int i = 0; i < (int)_process.size(); ++i) { /// This method runs the %BelmannFord algorithm from the root node(s) /// in order to compute the shortest path with at most \c length edge /// long pathes to each node. The algorithm computes /// long paths to each node. The algorithm computes /// - The shortest path tree. /// - The limited distance of each node from the root(s).
Note: See TracChangeset for help on using the changeset viewer.