COIN-OR::LEMON - Graph Library

Changeset 1763:49045f2d28d4 in lemon-0.x for lemon/dijkstra.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/dijkstra.h

    r1761 r1763  
    734734        p.clear();
    735735        typename P::Builder b(p);
    736         for(b.setStartNode(t);pred(t)!=INVALID;t=predNode(t))
    737           b.pushFront(pred(t));
     736        for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t))
     737          b.pushFront(predEdge(t));
    738738        b.commit();
    739739        return true;
     
    760760    ///this function.
    761761    ///\todo predEdge could be a better name.
    762     Edge pred(Node v) const { return (*_pred)[v]; }
     762    Edge predEdge(Node v) const { return (*_pred)[v]; }
    763763
    764764    ///Returns the 'previous node' of the shortest path tree.
     
    768768    ///root to \c /v. It is INVALID if \c v is unreachable from the root or if
    769769    ///\c v=s. The shortest path tree used here is equal to the shortest path
    770     ///tree used in \ref pred().  \pre \ref run() must be called before
     770    ///tree used in \ref predEdge().  \pre \ref run() must be called before
    771771    ///using this function.
    772772    Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID:
Note: See TracChangeset for help on using the changeset viewer.