Version 5.0 The LEDA User Manual

ool M.use edge data(const graph t& G, E x)
E& M[edge e] returns the variable M(v).
4. Implementation
use free data slots in the edges of G (if available) for storing
the entries of A. The number of additional data slots
in the nodes and edges of a graph can be specified in the
graph :: graph(int n slots, int e slots) constructor. The result
is true if a free slot is available and false otherwise.
Edge maps are implemented by an efficient hashing method based on the internal numbering
of the edges. An access operation takes expected time O(1).