#include <lemon/concepts/digraph.h>
Note that actual digraph implementation like ListDigraph or SmartDigraph may have several additional functionality.
Public Member Functions | |
Digraph () | |
| |
Node | target (Arc) const |
Node | source (Arc) const |
int | id (Node) const |
Returns the ID of the node. | |
int | id (Arc) const |
Returns the ID of the arc. | |
Node | nodeFromId (int) const |
Returns the node with the given ID. | |
Arc | arcFromId (int) const |
Returns the arc with the given ID. | |
int | maxNodeId () const |
Returns an upper bound on the node IDs. | |
int | maxArcId () const |
Returns an upper bound on the arc IDs. | |
Node | baseNode (const InArcIt &) const |
The base node of the iterator. | |
Node | runningNode (const InArcIt &) const |
The running node of the iterator. | |
Node | baseNode (const OutArcIt &) const |
The base node of the iterator. | |
Node | runningNode (const OutArcIt &) const |
The running node of the iterator. | |
Node | oppositeNode (const Node &, const Arc &) const |
The opposite node on the given arc. | |
Private Member Functions | |
Digraph (const Digraph &) | |
void | operator= (const Digraph &) |
Assignment of Digraphs to another ones are not allowed. Use DigraphCopy() instead. | |
Classes | |
class | Arc |
Class for identifying an arc of the digraph. More... | |
class | ArcIt |
This iterator goes through each arc. More... | |
class | ArcMap |
Read write map of the arcs to type T . More... | |
class | InArcIt |
This iterator goes trough the incoming arcs of a node. More... | |
class | Node |
Class for identifying a node of the digraph. More... | |
class | NodeIt |
This iterator goes through each node. More... | |
class | NodeMap |
Read write map of the nodes to type T . More... | |
class | OutArcIt |
This iterator goes trough the outgoing arcs of a node. More... |
Digraphs are not copy constructible. Use DigraphCopy() instead.
Digraph | ( | ) | [inline] |
Defalult constructor. Defalult constructor.
void operator= | ( | const Digraph & | ) | [inline, private] |
Assignment of Digraphs to another ones are not allowed. Use DigraphCopy() instead.
Node nodeFromId | ( | int | ) | const [inline] |
Arc arcFromId | ( | int | ) | const [inline] |
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.