# HG changeset patch
# User Alpar Juttner <alpar@cs.elte.hu>
# Date 1229119125 0
# Node ID 39b03fc708fdc4cb4696e09c6025cec96b6f5c28
# Parent  e9a568cc86e337737d8b2fe5442a690f29ec6f45# Parent  b0f74ca2e3ac2d7e7a63795d086d499323da8f0e
Merge

diff -r e9a568cc86e3 -r 39b03fc708fd lemon/core.h
--- a/lemon/core.h	Fri Dec 12 21:41:05 2008 +0000
+++ b/lemon/core.h	Fri Dec 12 21:58:45 2008 +0000
@@ -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;
   };