![]() |
abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
|
Map of the out-degrees of nodes in a digraph. More...
#include <lemon/maps.h>
Public Types | |
| typedef GR | Graph |
| The graph type of OutDegMap. | |
| typedef Digraph::Node | Key |
| The key type. | |
| typedef int | Value |
| The value type. | |
Public Member Functions | |
| OutDegMap (const Digraph &graph) | |
| Constructor. | |
| int | operator[] (const Key &key) const |
| Gives back the out-degree of a Node. | |
This map returns the out-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 digraph changes.
addNode() and addArc(), a digraph structure may provide alternative ways to modify the digraph. The correct behavior of OutDegMap is not guarantied if these additional features are used. For example, the functions changeSource(), changeTarget() and reverseArc() of ListDigraph will not update the degree values correctly.
|
inlineexplicit |
Constructor for creating an out-degree map.
|
inline |
Gives back the out-degree of a Node.