COIN-OR::LEMON - Graph Library

Changeset 2517:d9cfac072869 in lemon-0.x for lemon/bellman_ford.h


Ignore:
Timestamp:
11/20/07 22:40:55 (12 years ago)
Author:
Peter Kovacs
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3393
Message:

Small changes in the documentation.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bellman_ford.h

    r2476 r2517  
    436436    /// the path.
    437437    ///
    438     /// \return %True when the algorithm have not found more shorter
     438    /// \return \c true when the algorithm have not found more shorter
    439439    /// paths.
    440440    bool processNextRound() {
     
    473473    /// at most k length minimal paths, this is why it is
    474474    /// called just weak round.
    475     /// \return %True when the algorithm have not found more shorter paths.
     475    /// \return \c true when the algorithm have not found more shorter paths.
    476476    bool processNextWeakRound() {
    477477      for (int i = 0; i < int(_process.size()); ++i) {
     
    518518    ///
    519519    /// \pre init() must be called and at least one node should be added
    520     /// with addSource() before using this function. If there is
    521     /// a negative cycle in the graph it gives back false.
     520    /// with addSource() before using this function.
    522521    ///
    523522    /// This method runs the %BellmanFord algorithm from the root node(s)
     
    526525    /// - The shortest path tree.
    527526    /// - The distance of each node from the root(s).
     527    ///
     528    /// \return \c false if there is a negative cycle in the graph.
    528529    bool checkedStart() {
    529530      int num = countNodes(*graph);
Note: See TracChangeset for help on using the changeset viewer.