COIN-OR::LEMON - Graph Library

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

    r1754 r1763  
    504504        p.clear();
    505505        typename Path::Builder b(p);
    506         for(b.setStartNode(t);pred(t)!=INVALID;t=predNode(t))
    507           b.pushFront(pred(t));
     506        for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t))
     507          b.pushFront(predEdge(t));
    508508        b.commit();
    509509        return true;
     
    530530    /// this function.
    531531    /// \todo predEdge could be a better name.
    532     Edge pred(Node v) const { return (*_pred)[v]; }
     532    Edge predEdge(Node v) const { return (*_pred)[v]; }
    533533
    534534    /// \brief Returns the 'previous node' of the shortest path tree.
     
    538538    /// the root to \c /v. It is INVALID if \c v is unreachable from the root
    539539    /// or if \c v=s. The shortest path tree used here is equal to the
    540     /// shortest path tree used in \ref pred().  \pre \ref run() must be
     540    /// shortest path tree used in \ref predEdge().  \pre \ref run() must be
    541541    /// called before using this function.
    542542    Node predNode(Node v) const {
Note: See TracChangeset for help on using the changeset viewer.