1.1 --- a/lemon/bits/iterable_graph_extender.h	Mon Jul 18 15:03:55 2005 +0000
     1.2 +++ b/lemon/bits/iterable_graph_extender.h	Mon Jul 18 15:05:50 2005 +0000
     1.3 @@ -124,7 +124,7 @@
     1.4      ///
     1.5      /// \todo Document in the concept!
     1.6      Node baseNode(const OutEdgeIt &e) const {
     1.7 -      return source(e);
     1.8 +      return Parent::source((Edge)e);
     1.9      }
    1.10      /// Running node of the iterator
    1.11      ///
    1.12 @@ -133,7 +133,7 @@
    1.13      ///
    1.14      /// \todo Document in the concept!
    1.15      Node runningNode(const OutEdgeIt &e) const {
    1.16 -      return target(e);
    1.17 +      return Parent::target((Edge)e);
    1.18      }
    1.19  
    1.20      /// Base node of the iterator
    1.21 @@ -142,7 +142,7 @@
    1.22      ///
    1.23      /// \todo Document in the concept!
    1.24      Node baseNode(const InEdgeIt &e) const {
    1.25 -      return target(e);
    1.26 +      return Parent::target((Edge)e);
    1.27      }
    1.28      /// Running node of the iterator
    1.29      ///
    1.30 @@ -151,7 +151,7 @@
    1.31      ///
    1.32      /// \todo Document in the concept!
    1.33      Node runningNode(const InEdgeIt &e) const {
    1.34 -      return source(e);
    1.35 +      return Parent::source((Edge)e);
    1.36      }
    1.37  
    1.38      using Parent::first;