equal
deleted
inserted
replaced
555 EdgeIt(Invalid) { } |
555 EdgeIt(Invalid) { } |
556 /// This constructor sets the iterator to the first edge. |
556 /// This constructor sets the iterator to the first edge. |
557 |
557 |
558 /// This constructor sets the iterator to the first edge of \c g. |
558 /// This constructor sets the iterator to the first edge of \c g. |
559 ///@param g the graph |
559 ///@param g the graph |
560 EdgeIt(const UndirGraph &g) { } |
560 EdgeIt(const UndirGraph &g) { ignore_unused_variable_warning(g); } |
561 /// Edge -> EdgeIt conversion |
561 /// Edge -> EdgeIt conversion |
562 |
562 |
563 /// Sets the iterator to the value of the trivial iterator \c e. |
563 /// Sets the iterator to the value of the trivial iterator \c e. |
564 /// This feature necessitates that each time we |
564 /// This feature necessitates that each time we |
565 /// iterate the edge-set, the iteration order is the same. |
565 /// iterate the edge-set, the iteration order is the same. |
603 |
603 |
604 /// This constructor sets the iterator to the first outgoing edge of |
604 /// This constructor sets the iterator to the first outgoing edge of |
605 /// the node. |
605 /// the node. |
606 ///@param n the node |
606 ///@param n the node |
607 ///@param g the graph |
607 ///@param g the graph |
608 OutEdgeIt(const UndirGraph& n, const Node& g) { } |
608 OutEdgeIt(const UndirGraph& n, const Node& g) { |
|
609 ignore_unused_variable_warning(n); |
|
610 ignore_unused_variable_warning(g); |
|
611 } |
609 /// Edge -> OutEdgeIt conversion |
612 /// Edge -> OutEdgeIt conversion |
610 |
613 |
611 /// Sets the iterator to the value of the trivial iterator. |
614 /// Sets the iterator to the value of the trivial iterator. |
612 /// This feature necessitates that each time we |
615 /// This feature necessitates that each time we |
613 /// iterate the edge-set, the iteration order is the same. |
616 /// iterate the edge-set, the iteration order is the same. |
652 |
655 |
653 /// This constructor set the iterator to the first incoming edge of |
656 /// This constructor set the iterator to the first incoming edge of |
654 /// the node. |
657 /// the node. |
655 ///@param n the node |
658 ///@param n the node |
656 ///@param g the graph |
659 ///@param g the graph |
657 InEdgeIt(const UndirGraph& g, const Node& n) { } |
660 InEdgeIt(const UndirGraph& g, const Node& n) { |
|
661 ignore_unused_variable_warning(n); |
|
662 ignore_unused_variable_warning(g); |
|
663 } |
658 /// Edge -> InEdgeIt conversion |
664 /// Edge -> InEdgeIt conversion |
659 |
665 |
660 /// Sets the iterator to the value of the trivial iterator \c e. |
666 /// Sets the iterator to the value of the trivial iterator \c e. |
661 /// This feature necessitates that each time we |
667 /// This feature necessitates that each time we |
662 /// iterate the edge-set, the iteration order is the same. |
668 /// iterate the edge-set, the iteration order is the same. |