My Project
|
This class describes the interface of idable directed graphs. It extends BaseDigraphComponent with the core ID functions. The ids of the items must be unique and immutable. This concept is part of the Digraph concept.
#include <lemon/concepts/graph_components.h>
Public Member Functions | |
int | id (const Node &) const |
Return a unique integer id for the given node. More... | |
Node | nodeFromId (int) const |
Return the node by its unique id. More... | |
int | id (const Arc &) const |
Return a unique integer id for the given arc. More... | |
Arc | arcFromId (int) const |
Return the arc by its unique id. More... | |
int | maxNodeId () const |
Return an integer greater or equal to the maximum node id. More... | |
int | maxArcId () const |
Return an integer greater or equal to the maximum arc id. More... | |
![]() | |
Node | source (const Arc &) const |
Return the source node of an arc. More... | |
Node | target (const Arc &) const |
Return the target node of an arc. More... | |
Node | oppositeNode (const Node &, const Arc &) const |
Return the opposite node on the given arc. More... | |
Additional Inherited Members | |
![]() | |
typedef GraphItem< 'n'> | Node |
Node class of the digraph. More... | |
typedef GraphItem< 'a'> | Arc |
Arc class of the digraph. More... | |
|
inline |
This function returns a unique integer id for the given node.
|
inline |
This function returns the node by its unique id. If the digraph does not contain a node with the given id, then the result of the function is undefined.
|
inline |
This function returns a unique integer id for the given arc.
|
inline |
This function returns the arc by its unique id. If the digraph does not contain an arc with the given id, then the result of the function is undefined.
|
inline |
This function returns an integer greater or equal to the maximum node id.
|
inline |
This function returns an integer greater or equal to the maximum arc id.