Changeset 125:19e82bda606a in lemon-1.2 for lemon/bits

Timestamp:

04/14/08 18:37:18 (17 years ago)

Author:

Balazs Dezso <deba@…>

Branch:

default

Phase:

public

Message:

Fix bug #83 in graph concept, extender and smart graph

File:

• lemon/bits/graph_extender.h (modified) (4 diffs)

lemon/bits/graph_extender.h

@@ -368 +368 @@
 
     Node oppositeNode(const Node &n, const Edge &e) const {
-      if( n == Parent::source(e))
-        return Parent::target(e);
-      else if( n == Parent::target(e))
-        return Parent::source(e);
+      if( n == Parent::u(e))
+        return Parent::v(e);
+      else if( n == Parent::v(e))
+        return Parent::u(e);
       else
         return INVALID;
@@ -382 +382 @@
     using Parent::direct;
     Arc direct(const Edge &edge, const Node &node) const {
-      return Parent::direct(edge, Parent::source(edge) == node);
+      return Parent::direct(edge, Parent::u(edge) == node);
     }
 
@@ -587 +587 @@
     /// Returns the base node of the iterator
     Node baseNode(const IncEdgeIt &edge) const {
-      return edge._direction ? source(edge) : target(edge);
+      return edge._direction ? u(edge) : v(edge);
     }
     /// Running node of the iterator
@@ -593 +593 @@
     /// Returns the running node of the iterator
     Node runningNode(const IncEdgeIt &edge) const {
-      return edge._direction ? target(edge) : source(edge);
+      return edge._direction ? v(edge) : u(edge);
     }