IdMap< _Graph, _Item > Class Template Reference
[Graph Maps]

---

Detailed Description

template<typename _Graph, typename _Item>
class lemon::IdMap< _Graph, _Item >

The IdMap class provides a unique and immutable id for each item of the same type (e.g. node) in the graph. This id is

• unique: different items (nodes) get different ids
• immutable: the id of an item (node) does not change (even if you delete other nodes).

Through this map you get access (i.e. can read) the inner id values of the items stored in the graph. This map can be inverted with its member class InverseMap. #include <lemon/graph_utils.h>

List of all members.

Classes
class	InverseMap
	The class represents the inverse of its owner (IdMap). More...
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.

---

Constructor & Destructor Documentation

IdMap

(

const Graph &

_graph

)

[inline, explicit]

Constructor of the map.

---

Member Function Documentation

int operator[]

(

const Item &

item

)

const [inline]

Gives back the immutable and unique id of the item.

Item operator()

(

int

id

)

[inline]

Gives back the item by its id.

InverseMap inverse

(

)

const [inline]

Gives back the inverse of the IdMap.