#include <lemon/concept/undir_graph.h>
Inherits UndirGraph::UndirEdge.
Inheritance diagram for UndirGraph::UndirEdgeIt:
g
of type Graph
as follows: int count=0; for(Graph::UndirEdgeIt e(g); e!=INVALID; ++e) ++count;
Public Member Functions | |
UndirEdgeIt () | |
Default constructor. | |
UndirEdgeIt (const UndirEdgeIt &e) | |
Copy constructor. | |
UndirEdgeIt (Invalid) | |
Initialize the iterator to be invalid. | |
UndirEdgeIt (const UndirGraph &) | |
This constructor sets the iterator to the first undirected edge. | |
UndirEdgeIt (const UndirGraph &, const UndirEdge &) | |
UndirEdge -> UndirEdgeIt conversion. | |
UndirEdgeIt & | operator++ () |
Assign the iterator to the next undirected edge. |
|
|
|
Copy constructor. |
|
Initialize the iterator to be invalid. |
|
Sets the iterator to the value of the trivial iterator. This feature necessitates that each time we iterate the undirected edge-set, the iteration order is the same. |