COIN-OR::LEMON - Graph Library

Changeset 1754:4bf5ceb49023 in lemon-0.x for lemon/belmann_ford.h


Ignore:
Timestamp:
11/02/05 16:27:38 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2283
Message:

Documentation modified

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/belmann_ford.h

    r1741 r1754  
    142142  };
    143143 
    144   /// \brief BelmannFord algorithm class.
     144  /// \brief %BelmannFord algorithm class.
    145145  ///
    146146  /// \ingroup flowalgs
     
    152152  /// The Belmann-Ford algorithm solves the shortest path from one node
    153153  /// problem when the edges can have negative length but the graph should
    154   /// not contain circle with negative sum of length. If we can assume
     154  /// not contain cycles with negative sum of length. If we can assume
    155155  /// that all edge is non-negative in the graph then the dijkstra algorithm
    156156  /// should be used rather.
     
    429429    }
    430430
    431     /// \brief Executes the algorithm and checks the negative circles.
     431    /// \brief Executes the algorithm and checks the negative cycles.
    432432    ///
    433433    /// \pre init() must be called and at least one node should be added
    434434    /// with addSource() before using this function. If there is
    435     /// a negative circle in the graph it gives back false.
     435    /// a negative cycles in the graph it gives back false.
    436436    ///
    437437    /// This method runs the %BelmannFord algorithm from the root node(s)
Note: See TracChangeset for help on using the changeset viewer.