equal
deleted
inserted
replaced
230 /// without any sensible implementation. So any algorithm for |
230 /// without any sensible implementation. So any algorithm for |
231 /// undirected graph should compile with this class, but it will not |
231 /// undirected graph should compile with this class, but it will not |
232 /// run properly, of couse. |
232 /// run properly, of couse. |
233 /// |
233 /// |
234 /// In LEMON undirected graphs also fulfill the concept of directed |
234 /// In LEMON undirected graphs also fulfill the concept of directed |
235 /// graphs (\ref lemon::concept::Graph "Graph Concept"). For |
235 /// graphs (\ref lemon::concept::StaticGraph "Graph Concept"). For |
236 /// explanation of this and more see also the page \ref undir_graphs, |
236 /// explanation of this and more see also the page \ref undir_graphs, |
237 /// a tutorial about undirected graphs. |
237 /// a tutorial about undirected graphs. |
238 /// |
238 /// |
239 /// You can assume that all undirected graph can be handled |
239 /// You can assume that all undirected graph can be handled |
240 /// as a static directed graph. This way it is fully conform |
240 /// as a static directed graph. This way it is fully conform |
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&) { } |
560 EdgeIt(const UndirGraph &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&, const Node&) { } |
608 OutEdgeIt(const UndirGraph& n, const Node& g) { } |
609 /// Edge -> OutEdgeIt conversion |
609 /// Edge -> OutEdgeIt conversion |
610 |
610 |
611 /// Sets the iterator to the value of the trivial iterator. |
611 /// Sets the iterator to the value of the trivial iterator. |
612 /// This feature necessitates that each time we |
612 /// This feature necessitates that each time we |
613 /// iterate the edge-set, the iteration order is the same. |
613 /// iterate the edge-set, the iteration order is the same. |
652 |
652 |
653 /// This constructor set the iterator to the first incoming edge of |
653 /// This constructor set the iterator to the first incoming edge of |
654 /// the node. |
654 /// the node. |
655 ///@param n the node |
655 ///@param n the node |
656 ///@param g the graph |
656 ///@param g the graph |
657 InEdgeIt(const UndirGraph&, const Node&) { } |
657 InEdgeIt(const UndirGraph& g, const Node& n) { } |
658 /// Edge -> InEdgeIt conversion |
658 /// Edge -> InEdgeIt conversion |
659 |
659 |
660 /// Sets the iterator to the value of the trivial iterator \c e. |
660 /// Sets the iterator to the value of the trivial iterator \c e. |
661 /// This feature necessitates that each time we |
661 /// This feature necessitates that each time we |
662 /// iterate the edge-set, the iteration order is the same. |
662 /// iterate the edge-set, the iteration order is the same. |