1.1 --- a/lemon/bits/graph_extender.h Sat Apr 12 20:38:51 2008 +0100
1.2 +++ b/lemon/bits/graph_extender.h Mon Apr 14 17:37:18 2008 +0100
1.3 @@ -367,10 +367,10 @@
1.4 }
1.5
1.6 Node oppositeNode(const Node &n, const Edge &e) const {
1.7 - if( n == Parent::source(e))
1.8 - return Parent::target(e);
1.9 - else if( n == Parent::target(e))
1.10 - return Parent::source(e);
1.11 + if( n == Parent::u(e))
1.12 + return Parent::v(e);
1.13 + else if( n == Parent::v(e))
1.14 + return Parent::u(e);
1.15 else
1.16 return INVALID;
1.17 }
1.18 @@ -381,7 +381,7 @@
1.19
1.20 using Parent::direct;
1.21 Arc direct(const Edge &edge, const Node &node) const {
1.22 - return Parent::direct(edge, Parent::source(edge) == node);
1.23 + return Parent::direct(edge, Parent::u(edge) == node);
1.24 }
1.25
1.26 // Alterable extension
1.27 @@ -586,13 +586,13 @@
1.28 ///
1.29 /// Returns the base node of the iterator
1.30 Node baseNode(const IncEdgeIt &edge) const {
1.31 - return edge._direction ? source(edge) : target(edge);
1.32 + return edge._direction ? u(edge) : v(edge);
1.33 }
1.34 /// Running node of the iterator
1.35 ///
1.36 /// Returns the running node of the iterator
1.37 Node runningNode(const IncEdgeIt &edge) const {
1.38 - return edge._direction ? target(edge) : source(edge);
1.39 + return edge._direction ? v(edge) : u(edge);
1.40 }
1.41
1.42 // Mappable extension