equal
deleted
inserted
replaced
312 OutEdgeIt(Invalid) { } |
312 OutEdgeIt(Invalid) { } |
313 /// This constructor sets the iterator to the first outgoing edge. |
313 /// This constructor sets the iterator to the first outgoing edge. |
314 |
314 |
315 /// This constructor sets the iterator to the first outgoing edge of |
315 /// This constructor sets the iterator to the first outgoing edge of |
316 /// the node. |
316 /// the node. |
317 ///@param n the node |
|
318 ///@param g the graph |
|
319 OutEdgeIt(const StaticGraph&, const Node&) { } |
317 OutEdgeIt(const StaticGraph&, const Node&) { } |
320 /// Edge -> OutEdgeIt conversion |
318 /// Edge -> OutEdgeIt conversion |
321 |
319 |
322 /// Sets the iterator to the value of the trivial iterator. |
320 /// Sets the iterator to the value of the trivial iterator. |
323 /// This feature necessitates that each time we |
321 /// This feature necessitates that each time we |
361 InEdgeIt(Invalid) { } |
359 InEdgeIt(Invalid) { } |
362 /// This constructor sets the iterator to first incoming edge. |
360 /// This constructor sets the iterator to first incoming edge. |
363 |
361 |
364 /// This constructor set the iterator to the first incoming edge of |
362 /// This constructor set the iterator to the first incoming edge of |
365 /// the node. |
363 /// the node. |
366 ///@param n the node |
|
367 ///@param g the graph |
|
368 InEdgeIt(const StaticGraph&, const Node&) { } |
364 InEdgeIt(const StaticGraph&, const Node&) { } |
369 /// Edge -> InEdgeIt conversion |
365 /// Edge -> InEdgeIt conversion |
370 |
366 |
371 /// 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. |
372 /// This feature necessitates that each time we |
368 /// This feature necessitates that each time we |