#include <lemon/concept/ugraph.h>
Inherits UGraph::UEdge.
Inheritance diagram for UGraph::UEdgeIt:
g
of type Graph
as follows: int count=0; for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
Public Member Functions | |
UEdgeIt () | |
Default constructor. | |
UEdgeIt (const UEdgeIt &e) | |
Copy constructor. | |
UEdgeIt (Invalid) | |
Initialize the iterator to be invalid. | |
UEdgeIt (const UGraph &) | |
This constructor sets the iterator to the first undirected edge. | |
UEdgeIt (const UGraph &, const UEdge &) | |
UEdge -> UEdgeIt conversion. | |
UEdgeIt & | 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. |