COIN-OR::LEMON - Graph Library

Changeset 1816:19ee9133a28c in lemon-0.x


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

Legend:

Unmodified
Added
Removed
  • lemon/belmann_ford.h

    r1783 r1816  
    420420    ///
    421421    /// 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?
    425426    bool processNextRound() {
    426427      for (int i = 0; i < (int)_process.size(); ++i) {
     
    453454    ///
    454455    /// 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?
    459462    bool processNextWeakRound() {
    460463      for (int i = 0; i < (int)_process.size(); ++i) {
     
    524527    /// This method runs the %BelmannFord algorithm from the root node(s)
    525528    /// in order to compute the shortest path with at most \c length edge
    526     /// long pathes to each node. The algorithm computes
     529    /// long paths to each node. The algorithm computes
    527530    /// - The shortest path tree.
    528531    /// - The limited distance of each node from the root(s).
Note: See TracChangeset for help on using the changeset viewer.