1.1 --- a/lemon/graph_utils.h	Sat Jun 14 19:52:08 2008 +0200
     1.2 +++ b/lemon/graph_utils.h	Sun Jun 15 09:19:53 2008 +0200
     1.3 @@ -402,10 +402,10 @@
     1.4            if (e == INVALID) {
     1.5              g.firstInc(e, b, u);
     1.6            } else {
     1.7 -            b = g.source(e) == u;
     1.8 +            b = g.u(e) == u;
     1.9              g.nextInc(e, b);
    1.10            }
    1.11 -          while (e != INVALID && (b ? g.target(e) : g.source(e)) != v) {
    1.12 +          while (e != INVALID && (b ? g.v(e) : g.u(e)) != v) {
    1.13              g.nextInc(e, b);
    1.14            }
    1.15          } else {
    1.16 @@ -415,7 +415,7 @@
    1.17              b = true;
    1.18              g.nextInc(e, b);
    1.19            }
    1.20 -          while (e != INVALID && (!b || g.target(e) != v)) {
    1.21 +          while (e != INVALID && (!b || g.v(e) != v)) {
    1.22              g.nextInc(e, b);
    1.23            }
    1.24          }
    1.25 @@ -455,7 +455,7 @@
    1.26    /// }
    1.27    ///\endcode
    1.28    ///
    1.29 -  ///\sa ConArcIt
    1.30 +  ///\sa ConEdgeIt
    1.31  
    1.32    template <typename Graph>
    1.33    inline typename Graph::Edge 
    1.34 @@ -504,8 +504,8 @@
    1.35      ///
    1.36      /// It increments the iterator and gives back the next edge.
    1.37      ConEdgeIt& operator++() {
    1.38 -      Parent::operator=(findEdge(_graph, _graph.source(*this), 
    1.39 -				 _graph.target(*this), *this));
    1.40 +      Parent::operator=(findEdge(_graph, _graph.u(*this), 
    1.41 +				 _graph.v(*this), *this));
    1.42        return *this;
    1.43      }
    1.44    private: