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

Timestamp:

11/04/05 15:48:10 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2295

Message:

pred => predEdge rename

File:

• lemon/belmann_ford.h (modified) (3 diffs)

lemon/belmann_ford.h

@@ -504 +504 @@
         p.clear();
         typename Path::Builder b(p);
-        for(b.setStartNode(t);pred(t)!=INVALID;t=predNode(t))
-          b.pushFront(pred(t));
+        for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t))
+          b.pushFront(predEdge(t));
         b.commit();
         return true;
@@ -530 +530 @@
     /// this function.
     /// \todo predEdge could be a better name.
-    Edge pred(Node v) const { return (*_pred)[v]; }
+    Edge predEdge(Node v) const { return (*_pred)[v]; }
 
     /// \brief Returns the 'previous node' of the shortest path tree.
@@ -538 +538 @@
     /// the root to \c /v. It is INVALID if \c v is unreachable from the root 
     /// or if \c v=s. The shortest path tree used here is equal to the 
-    /// shortest path tree used in \ref pred().  \pre \ref run() must be 
+    /// shortest path tree used in \ref predEdge().  \pre \ref run() must be 
     /// called before using this function.
     Node predNode(Node v) const {