Home | Documentation | Download | Platforms | Projects | Mailing Lists | Version History

Public Member Functions | |
| void | init (const Graph &, Value def=Value()) |
| value_reference | operator[] (Key key) |
| const_value_reference | operator[] (Key key) const |
| void | clear () |
Protected Member Functions | |
| ne_map () | |
| ne_map (const Graph &g, Value def=Value()) | |
ne_map is the common implementation of node_map and edge_map and cannot be used directly.
| void ne_map< Key, Value, Graph, Alloc >::init | ( | const Graph & | g, | |
| Value | def = Value() | |||
| ) | [inline] |
| ne_map< Key, Value, Graph, Alloc >::value_reference ne_map< Key, Value, Graph, Alloc >::operator[] | ( | Key | key | ) | [inline] |
Read/write accessor function to the value associated with key. Use this function to change the value of an element in the ne_map. Assume that ne is a ne_map<int>. Then you can assign the value 5 to key with:
ne[key] = 5;
If there is no entry in the ne_map associated with key, one is created.
| key | Key of the Entry to change |
key. | ne_map< Key, Value, Graph, Alloc >::const_value_reference ne_map< Key, Value, Graph, Alloc >::operator[] | ( | Key | key | ) | const [inline] |
Read-only accessor function to the value associated with key. Use this function to read the value of an element in the ne_map. Assume that ne is a ne_map<int>. Then you can print the value associated with key with:
cout << ne[key];
| key | Key of the Entry to look up |
key. | void ne_map< Key, Value, Graph, Alloc >::clear | ( | ) | [inline] |
Erases a elements of this nodemap
University of Passau - FMI - Theoretical Computer Science