equal
deleted
inserted
replaced
380 ArcIt(Invalid) { } |
380 ArcIt(Invalid) { } |
381 /// This constructor sets the iterator to the first arc. |
381 /// This constructor sets the iterator to the first arc. |
382 |
382 |
383 /// This constructor sets the iterator to the first arc of \c g. |
383 /// This constructor sets the iterator to the first arc of \c g. |
384 ///@param g the graph |
384 ///@param g the graph |
385 ArcIt(const Graph &g) { ignore_unused_variable_warning(g); } |
385 ArcIt(const Graph &g) { ::lemon::ignore_unused_variable_warning(g); } |
386 /// Arc -> ArcIt conversion |
386 /// Arc -> ArcIt conversion |
387 |
387 |
388 /// Sets the iterator to the value of the trivial iterator \c e. |
388 /// Sets the iterator to the value of the trivial iterator \c e. |
389 /// This feature necessitates that each time we |
389 /// This feature necessitates that each time we |
390 /// iterate the arc-set, the iteration order is the same. |
390 /// iterate the arc-set, the iteration order is the same. |
429 /// This constructor sets the iterator to the first outgoing arc of |
429 /// This constructor sets the iterator to the first outgoing arc of |
430 /// the node. |
430 /// the node. |
431 ///@param n the node |
431 ///@param n the node |
432 ///@param g the graph |
432 ///@param g the graph |
433 OutArcIt(const Graph& n, const Node& g) { |
433 OutArcIt(const Graph& n, const Node& g) { |
434 ignore_unused_variable_warning(n); |
434 ::lemon::ignore_unused_variable_warning(n); |
435 ignore_unused_variable_warning(g); |
435 ::lemon::ignore_unused_variable_warning(g); |
436 } |
436 } |
437 /// Arc -> OutArcIt conversion |
437 /// Arc -> OutArcIt conversion |
438 |
438 |
439 /// Sets the iterator to the value of the trivial iterator. |
439 /// Sets the iterator to the value of the trivial iterator. |
440 /// This feature necessitates that each time we |
440 /// This feature necessitates that each time we |
481 /// This constructor set the iterator to the first incoming arc of |
481 /// This constructor set the iterator to the first incoming arc of |
482 /// the node. |
482 /// the node. |
483 ///@param n the node |
483 ///@param n the node |
484 ///@param g the graph |
484 ///@param g the graph |
485 InArcIt(const Graph& g, const Node& n) { |
485 InArcIt(const Graph& g, const Node& n) { |
486 ignore_unused_variable_warning(n); |
486 ::lemon::ignore_unused_variable_warning(n); |
487 ignore_unused_variable_warning(g); |
487 ::lemon::ignore_unused_variable_warning(g); |
488 } |
488 } |
489 /// Arc -> InArcIt conversion |
489 /// Arc -> InArcIt conversion |
490 |
490 |
491 /// Sets the iterator to the value of the trivial iterator \c e. |
491 /// Sets the iterator to the value of the trivial iterator \c e. |
492 /// This feature necessitates that each time we |
492 /// This feature necessitates that each time we |