# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 2008-12-12 21:37:22
# Node ID b0f74ca2e3ac2d7e7a63795d086d499323da8f0e
# Parent  62f9787c516c468a3676bb7a91731da83aa64543

Bug fix in ConEdgeIt (#195)

diff --git a/lemon/core.h b/lemon/core.h
--- a/lemon/core.h
+++ b/lemon/core.h
@@ -1170,8 +1170,8 @@
     ///
     /// Construct a new ConEdgeIt iterating on the edges that
     /// connects nodes \c u and \c v.
-    ConEdgeIt(const Graph& g, Node u, Node v) : _graph(g) {
-      Parent::operator=(findEdge(_graph, u, v));
+    ConEdgeIt(const Graph& g, Node u, Node v) : _graph(g), _u(u), _v(v) {
+      Parent::operator=(findEdge(_graph, _u, _v));
     }
 
     /// \brief Constructor.
@@ -1183,12 +1183,12 @@
     ///
     /// It increments the iterator and gives back the next edge.
     ConEdgeIt& operator++() {
-      Parent::operator=(findEdge(_graph, _graph.u(*this),
-                                 _graph.v(*this), *this));
+      Parent::operator=(findEdge(_graph, _u, _v, *this));
       return *this;
     }
   private:
     const Graph& _graph;
+    Node _u, _v;
   };