#include <lemon/concept/graph_component.h>
Inherits BaseGraphComponent.
Inherited by _StaticGraph.
Inheritance diagram for IterableGraphComponent:
Public Types | |
typedef GraphIterator< Graph, Node > | NodeIt |
This iterator goes through each node. | |
typedef GraphIterator< Graph, Edge > | EdgeIt |
This iterator goes through each node. | |
typedef GraphIncIterator< Graph, Edge, 'i'> | InEdgeIt |
This iterator goes trough the incoming edges of a node. | |
typedef GraphIncIterator< Graph, Edge, 'o'> | OutEdgeIt |
This iterator goes trough the outgoing edges of a node. | |
Public Member Functions | |
Node | baseNode (const InEdgeIt &) const |
The base node of the iterator. | |
Node | runningNode (const InEdgeIt &) const |
The running node of the iterator. | |
Node | baseNode (const OutEdgeIt &) const |
The base node of the iterator. | |
Node | runningNode (const OutEdgeIt &) const |
The running node of the iterator. | |
Node | oppositeNode (const Node &, const Edge &) const |
The opposite node on the given edge. |
|
This iterator goes through each node. |
|
This iterator goes through each node. |
|
This iterator goes trough the inccoming edges of a certain node of a graph. |
|
This iterator goes trough the outgoing edges of a certain node of a graph. |
|
Gives back the base node of the iterator. It is always the target of the pointed edge. |
|
Gives back the running node of the iterator. It is always the source of the pointed edge. |
|
Gives back the base node of the iterator. It is always the source of the pointed edge. |
|
Gives back the running node of the iterator. It is always the target of the pointed edge. |
|
Gives back the opposite on the given edge.
|