InDegMap< _Graph > Class Template Reference
[Graph Maps]

---

Detailed Description

template<typename _Graph>
class lemon::InDegMap< _Graph >

This map returns the in-degree of a node. Once it is constructed, the degrees are stored in a standard NodeMap, so each query is done in constant time. On the other hand, the values are updated automatically whenever the graph changes.

Warning:

Besides addNode() and addEdge(), a graph structure may provide alternative ways to modify the graph. The correct behavior of InDegMap is not guarantied if these additional features are used. For example the functions changeSource(), changeTarget() and reverseEdge() of ListGraph will not update the degree values correctly.

See also:

OutDegMap

#include <lemon/graph_utils.h>

List of all members.

Public Member Functions
	InDegMap (const Graph &_graph)
	Constructor.
int	operator[] (const Key &key) const
	Gives back the in-degree of a Node.

---

Constructor & Destructor Documentation

InDegMap

(

const Graph &

_graph

)

[inline, explicit]

Constructor for creating in-degree map.