Changeset 169:5b507a86ad72 in lemon-1.2 for lemon/graph_utils.h

Timestamp:

06/15/08 09:19:53 (17 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Fix various rename bugs

File:

• lemon/graph_utils.h (modified) (4 diffs)

lemon/graph_utils.h

@@ -403 +403 @@
             g.firstInc(e, b, u);
           } else {
-            b = g.source(e) == u;
+            b = g.u(e) == u;
             g.nextInc(e, b);
           }
-          while (e != INVALID && (b ? g.target(e) : g.source(e)) != v) {
+          while (e != INVALID && (b ? g.v(e) : g.u(e)) != v) {
             g.nextInc(e, b);
           }
@@ -416 +416 @@
             g.nextInc(e, b);
           }
-          while (e != INVALID && (!b || g.target(e) != v)) {
+          while (e != INVALID && (!b || g.v(e) != v)) {
             g.nextInc(e, b);
           }
@@ -456 +456 @@
   ///\endcode
   ///
-  ///\sa ConArcIt
+  ///\sa ConEdgeIt
 
   template <typename Graph>
@@ -505 +505 @@
     /// It increments the iterator and gives back the next edge.
     ConEdgeIt& operator++() {
-      Parent::operator=(findEdge(_graph, _graph.source(*this), 
-                                 _graph.target(*this), *this));
+      Parent::operator=(findEdge(_graph, _graph.u(*this), 
+                                 _graph.v(*this), *this));
       return *this;
     }