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