template<typename BAS = BaseDigraphComponent>
class lemon::concepts::IDableDigraphComponent< BAS >
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>
|
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...
|
|
int id |
( |
const Node & |
| ) |
const |
|
inline |
This function returns a unique integer id for the given node.
Node nodeFromId |
( |
int |
| ) |
const |
|
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.
int id |
( |
const Arc & |
| ) |
const |
|
inline |
This function returns a unique integer id for the given arc.
Arc arcFromId |
( |
int |
| ) |
const |
|
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.
This function returns an integer greater or equal to the maximum node id.
This function returns an integer greater or equal to the maximum arc id.