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