[Lemon-commits] Peter Kovacs: Bug fix in ConEdgeIt (#195)

[Lemon HG]

details:   http://lemon.cs.elte.hu/hg/lemon/rev/b0f74ca2e3ac
changeset: 449:b0f74ca2e3ac
user:      Peter Kovacs <kpeter [at] inf.elte.hu>
date:      Fri Dec 12 21:37:22 2008 +0100
description:
	Bug fix in ConEdgeIt (#195)

diffstat:

1 file changed, 4 insertions(+), 4 deletions(-)
lemon/core.h |    8 ++++----

diffs (29 lines):

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;
   };