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