equal
deleted
inserted
replaced
312 /// |
312 /// |
313 UndirEdgeIt(Invalid) { } |
313 UndirEdgeIt(Invalid) { } |
314 /// This constructor sets the iterator to the first edge. |
314 /// This constructor sets the iterator to the first edge. |
315 |
315 |
316 /// This constructor sets the iterator to the first edge of \c g. |
316 /// This constructor sets the iterator to the first edge of \c g. |
317 ///@param g the graph |
|
318 UndirEdgeIt(const UndirGraph&) { } |
317 UndirEdgeIt(const UndirGraph&) { } |
319 /// UndirEdge -> UndirEdgeIt conversion |
318 /// UndirEdge -> UndirEdgeIt conversion |
320 |
319 |
321 /// Sets the iterator to the value of the trivial iterator \c e. |
320 /// Sets the iterator to the value of the trivial iterator \c e. |
322 /// This feature necessitates that each time we |
321 /// This feature necessitates that each time we |
360 IncEdgeIt(Invalid) { } |
359 IncEdgeIt(Invalid) { } |
361 /// This constructor sets the iterator to first incident edge. |
360 /// This constructor sets the iterator to first incident edge. |
362 |
361 |
363 /// This constructor set the iterator to the first incident edge of |
362 /// This constructor set the iterator to the first incident edge of |
364 /// the node. |
363 /// the node. |
365 ///@param n the node |
|
366 ///@param g the graph |
|
367 IncEdgeIt(const UndirGraph&, const Node&) { } |
364 IncEdgeIt(const UndirGraph&, const Node&) { } |
368 /// UndirEdge -> IncEdgeIt conversion |
365 /// UndirEdge -> IncEdgeIt conversion |
369 |
366 |
370 /// Sets the iterator to the value of the trivial iterator \c e. |
367 /// Sets the iterator to the value of the trivial iterator \c e. |
371 /// This feature necessitates that each time we |
368 /// This feature necessitates that each time we |