This class describes the concept of the immutable directed digraphs.
Note that actual digraph implementation like ListDigraph or SmartDigraph may have several additional functionality.
- See Also
- Concepts
#include <lemon/concepts/digraph.h>
Digraphs are not copy constructible. Use DigraphCopy() instead.
Defalult constructor. Defalult constructor.
Assignment of Digraphs to another ones are not allowed. Use DigraphCopy() instead.
Gives back the target node of an arc.
Gives back the source node of an arc.
Node nodeFromId |
( |
int |
| ) |
const |
|
inline |
- Precondition
- The argument should be a valid node ID in the graph.
Arc arcFromId |
( |
int |
| ) |
const |
|
inline |
- Precondition
- The argument should be a valid arc ID in the graph.
Gives back the base node of the iterator. It is always the target of the pointed arc.
Gives back the running node of the iterator. It is always the source of the pointed arc.
Gives back the base node of the iterator. It is always the source of the pointed arc.
Gives back the running node of the iterator. It is always the target of the pointed arc.
Gives back the opposite node on the given arc.