equal
deleted
inserted
replaced
1168 |
1168 |
1169 /// \brief Constructor. |
1169 /// \brief Constructor. |
1170 /// |
1170 /// |
1171 /// Construct a new ConEdgeIt iterating on the edges that |
1171 /// Construct a new ConEdgeIt iterating on the edges that |
1172 /// connects nodes \c u and \c v. |
1172 /// connects nodes \c u and \c v. |
1173 ConEdgeIt(const Graph& g, Node u, Node v) : _graph(g) { |
1173 ConEdgeIt(const Graph& g, Node u, Node v) : _graph(g), _u(u), _v(v) { |
1174 Parent::operator=(findEdge(_graph, u, v)); |
1174 Parent::operator=(findEdge(_graph, _u, _v)); |
1175 } |
1175 } |
1176 |
1176 |
1177 /// \brief Constructor. |
1177 /// \brief Constructor. |
1178 /// |
1178 /// |
1179 /// Construct a new ConEdgeIt that continues iterating from edge \c e. |
1179 /// Construct a new ConEdgeIt that continues iterating from edge \c e. |
1181 |
1181 |
1182 /// \brief Increment operator. |
1182 /// \brief Increment operator. |
1183 /// |
1183 /// |
1184 /// It increments the iterator and gives back the next edge. |
1184 /// It increments the iterator and gives back the next edge. |
1185 ConEdgeIt& operator++() { |
1185 ConEdgeIt& operator++() { |
1186 Parent::operator=(findEdge(_graph, _graph.u(*this), |
1186 Parent::operator=(findEdge(_graph, _u, _v, *this)); |
1187 _graph.v(*this), *this)); |
|
1188 return *this; |
1187 return *this; |
1189 } |
1188 } |
1190 private: |
1189 private: |
1191 const Graph& _graph; |
1190 const Graph& _graph; |
|
1191 Node _u, _v; |
1192 }; |
1192 }; |
1193 |
1193 |
1194 |
1194 |
1195 ///Dynamic arc look-up between given endpoints. |
1195 ///Dynamic arc look-up between given endpoints. |
1196 |
1196 |