This iterator goes trough the incident undirected edges of a certain node of a graph. Its usage is quite simple, for example, you can compute the degree (i.e. the number of incident edges) of a node n
in a graph g
of type Graph
as follows.
#include <lemon/concepts/graph.h>
Public Member Functions | |
IncEdgeIt () | |
Default constructor. | |
IncEdgeIt (const IncEdgeIt &e) | |
IncEdgeIt (Invalid) | |
Invalid constructor & conversion. | |
IncEdgeIt (const Graph &, const Node &) | |
Sets the iterator to the first incident edge. | |
IncEdgeIt (const Graph &, const Edge &) | |
Sets the iterator to the given edge. | |
IncEdgeIt & | operator++ () |
Next incident edge. | |
![]() | |
Edge () | |
Default constructor. | |
Edge (const Edge &) | |
Edge (Invalid) | |
Invalid constructor & conversion. | |
bool | operator== (Edge) const |
Equality operator. | |
bool | operator!= (Edge) const |
bool | operator< (Edge) const |
Artificial ordering operator. | |
|
inline |
Default constructor.
Initializes the iterator to be invalid.
Sets the iterator to the first incident edge of the given node.
Sets the iterator to the given edge of the given graph.
|
inline |
Assign the iterator to the next incident edge of the corresponding node.