gravatar
alpar (Alpar Juttner)
alpar@cs.elte.hu
Merge
0 1 0
merge default
0 files changed with 4 insertions and 4 deletions:
↑ Collapse diff ↑
Show white space 6 line context
... ...
@@ -1170,8 +1170,8 @@
1170 1170
    ///
1171 1171
    /// Construct a new ConEdgeIt iterating on the edges that
1172 1172
    /// connects nodes \c u and \c v.
1173
    ConEdgeIt(const Graph& g, Node u, Node v) : _graph(g) {
1174
      Parent::operator=(findEdge(_graph, u, v));
1173
    ConEdgeIt(const Graph& g, Node u, Node v) : _graph(g), _u(u), _v(v) {
1174
      Parent::operator=(findEdge(_graph, _u, _v));
1175 1175
    }
1176 1176

	
1177 1177
    /// \brief Constructor.
... ...
@@ -1183,12 +1183,12 @@
1183 1183
    ///
1184 1184
    /// It increments the iterator and gives back the next edge.
1185 1185
    ConEdgeIt& operator++() {
1186
      Parent::operator=(findEdge(_graph, _graph.u(*this),
1187
                                 _graph.v(*this), *this));
1186
      Parent::operator=(findEdge(_graph, _u, _v, *this));
1188 1187
      return *this;
1189 1188
    }
1190 1189
  private:
1191 1190
    const Graph& _graph;
1191
    Node _u, _v;
1192 1192
  };
1193 1193

	
1194 1194

	
0 comments (0 inline)