#include <lemon/concept/ugraph.h>
Inherits UGraph::UEdge.
Inheritance diagram for UGraph::IncEdgeIt:
n
in graph g
of type Graph
as follows. int count=0; for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
Public Member Functions | |
IncEdgeIt () | |
Default constructor. | |
IncEdgeIt (const IncEdgeIt &e) | |
Copy constructor. | |
IncEdgeIt (Invalid) | |
Initialize the iterator to be invalid. | |
IncEdgeIt (const UGraph &, const Node &) | |
This constructor sets the iterator to first incident edge. | |
IncEdgeIt (const UGraph &, const UEdge &) | |
UEdge -> IncEdgeIt conversion. | |
IncEdgeIt & | operator++ () |
Next incident edge. |
|
|
|
Copy constructor. |
|
Initialize the iterator to be invalid. |
|
This constructor set the iterator to the first incident edge of the node. |
|
Sets the iterator to the value of the trivial iterator |
|
Assign the iterator to the next incident edge of the corresponding node. |