# HG changeset patch # User Alpar Juttner # Date 2008-12-12 23:16:17 # Node ID 30d22b636e57c46ade8b17a1e78498ca113d529d # Parent 5c69a36729cbeaab976df88a5747a71d89629943 # Parent 39b03fc708fdc4cb4696e09c6025cec96b6f5c28 Merge 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; };