IdMap provides a unique and immutable id for each item of the same type (Node
, Arc
or Edge
) in a graph. This id is
Using this map you get access (i.e. can read) the inner id values of the items stored in the graph, which is returned by the id()
function of the graph. This map can be inverted with its member class InverseMap
or with the operator()
member.
GR | The graph type. |
K | The key type of the map (GR::Node , GR::Arc or GR::Edge ). |
#include <lemon/maps.h>
Classes | |
class | InverseMap |
This class represents the inverse of its owner (IdMap). More... | |
Public Types | |
typedef GR | Graph |
The graph type of IdMap. | |
typedef K | Item |
The key type of IdMap (Node , Arc or Edge ). | |
typedef K | Key |
The key type of IdMap (Node , Arc or Edge ). | |
typedef int | Value |
The value type of IdMap. | |
![]() | |
typedef K | Key |
The key type of the map. | |
typedef int | Value |
The value type of the map. (The type of objects associated with the keys). | |
Public Member Functions | |
IdMap (const Graph &graph) | |
Constructor. | |
int | operator[] (const Item &item) const |
Gives back the id of the item. | |
Item | operator() (int id) |
InverseMap | inverse () const |
Gives back the inverse of the map. | |
|
inline |
Gives back the immutable and unique id of the item.
|
inline |
Gives back the item by its id.
|
inline |
Gives back the inverse of the IdMap.