LEMON 1.0.7
|
This class provides beside the core digraph features core id functions for the digraph structure. The most of the base digraphs should be conform to this concept. The id's are unique and immutable.
#include <lemon/concepts/graph_components.h>
Public Member Functions | |
int | id (const Node &) const |
Node | nodeFromId (int) const |
Gives back the node by the unique id. | |
int | id (const Arc &) const |
Arc | arcFromId (int) const |
Gives back the arc by the unique id. | |
int | maxNodeId () const |
int | maxArcId () const |
int id | ( | const Node & | ) | const [inline] |
Gives back an unique integer id for the Node.
Node nodeFromId | ( | int | ) | const [inline] |
Gives back the node by the unique id. If the digraph does not contain node with the given id then the result of the function is undetermined.
int id | ( | const Arc & | ) | const [inline] |
Gives back an unique integer id for the Arc.
Arc arcFromId | ( | int | ) | const [inline] |
Gives back the arc by the unique id. If the digraph does not contain arc with the given id then the result of the function is undetermined.
int maxNodeId | ( | ) | const [inline] |
Gives back an integer greater or equal to the maximum Node id.
int maxArcId | ( | ) | const [inline] |
Gives back an integer greater or equal to the maximum Arc id.