LEMON 1.0.7
|
This class provides beside the core undirected graph features core id functions for the undirected graph structure. The most of the base undirected graphs 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 Edge &) const |
Edge | edgeFromId (int) const |
Gives back the edge by the unique id. | |
int | maxEdgeId () const |
int id | ( | const Edge & | ) | const [inline] |
Gives back an unique integer id for the Edge.
Edge edgeFromId | ( | int | ) | const [inline] |
Gives back the edge by the unique id. If the graph does not contain arc with the given id then the result of the function is undetermined.
int maxEdgeId | ( | ) | const [inline] |
Gives back an integer greater or equal to the maximum Edge id.