COIN-OR::LEMON - Graph Library

Changeset 2362:eb37b9774ef6 in lemon-0.x


Ignore:
Timestamp:
02/15/07 14:06:23 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3173
Message:

Small changes

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bellman_ford.h

    r2335 r2362  
    525525    /// - The distance of each node from the root(s).
    526526    bool checkedStart() {
    527       int num = countNodes(*graph);
     527      int num = countNodes(*graph) - 1;
    528528      for (int i = 0; i < num; ++i) {
    529529        if (processNextWeakRound()) return true;
    530530      }
    531       return false;
     531      return _process.empty();
    532532    }
    533533
     
    585585    /// - The distance of each node from the root.
    586586    ///
    587     /// \note d.run(s, len) is just a shortcut of the following code.
     587    /// \note d.run(s, num) is just a shortcut of the following code.
    588588    ///\code
    589589    ///  d.init();
    590590    ///  d.addSource(s);
    591     ///  d.limitedStart(len);
     591    ///  d.limitedStart(num);
    592592    ///\endcode
    593     void run(Node s, int len) {
     593    void run(Node s, int num) {
    594594      init();
    595595      addSource(s);
    596       limitedStart(len);
     596      limitedStart(num);
    597597    }
    598598   
     
    609609    /// \brief Lemon iterator for get a active nodes.
    610610    ///
    611     /// Lemon iterator for get a active nodes. This class provides a
     611    /// Lemon iterator for get the active nodes. This class provides a
    612612    /// common style lemon iterator which gives back a subset of the
    613613    /// nodes. The iterated nodes are active in the algorithm after
Note: See TracChangeset for help on using the changeset viewer.