COIN-OR::LEMON - Graph Library

Changeset 1763:49045f2d28d4 in lemon-0.x for lemon/johnson.h


Ignore:
Timestamp:
11/04/05 15:48:10 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2295
Message:

pred => predEdge rename

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/johnson.h

    r1757 r1763  
    510510            _dist->set(it, jt, dijkstra.dist(jt) +
    511511                       potential[jt] - potential[it]);
    512             _pred->set(it, jt, dijkstra.pred(jt));
     512            _pred->set(it, jt, dijkstra.predEdge(jt));
    513513          } else {
    514514            _dist->set(it, jt, OperationTraits::infinity());
     
    635635        p.clear();
    636636        typename Path::Builder b(target);
    637         for(b.setStartNode(target); pred(source, target) != INVALID;
     637        for(b.setStartNode(target); predEdge(source, target) != INVALID;
    638638            target = predNode(target)) {
    639           b.pushFront(pred(source, target));
     639          b.pushFront(predEdge(source, target));
    640640        }
    641641        b.commit();
     
    665665    /// \pre \ref run() must be called before using this function.
    666666    /// \todo predEdge could be a better name.
    667     Edge pred(Node root, Node node) const {
     667    Edge predEdge(Node root, Node node) const {
    668668      return (*_pred)(root, node);
    669669    }
     
    676676    /// INVALID if \c node is unreachable from the root or if \c node=root.
    677677    /// The shortest path tree used here is equal to the
    678     /// shortest path tree used in \ref pred(). 
     678    /// shortest path tree used in \ref predEdge(). 
    679679    /// \pre \ref run() must be called before using this function.
    680680    Node predNode(Node root, Node node) const {
Note: See TracChangeset for help on using the changeset viewer.