Version 5.0 The LEDA User Manual

11.12 Edge Maps ( edge map )
1. Definition
An instance of the data type edge map is a map for the edges of a graph G, i.e.,
equivalent to map (cf. 7.4). It can be used as a dynamic variant of the data
type edge array (cf. 11.9). New: Since edge map is derived from edge array edge
maps can be passed (by reference) to functions with edge array parameters. In particular,
all LEDA graph algorithms expecting an edge array& argument can be passed an
edge map& instead.
#include < LEDA/graph/edge map.h >
2. Creation
edge map M;
introduces a variable M of type edge map and initializes it to
the map with empty domain.
edge map M(const graph t& G);
edge map M(const graph t& G, E x);
introduces a variable M of type edge map and initializes it with
a mapping m from the set of all edges of G into the set of variables
of type E. The variables in the range of m are initialized by a call
of the default constructor of type E.
introduces a variable M of type edge map and initializes it with
a mapping m from the set of all edges of G into the set of variables
of type E. The variables in the range of m are initialized with a
copy of x.
3. Operations
const graph t& M.get graph( ) returns a reference to the graph of M.
void M.init( ) makes M a edge map with empty domain.
void M.init(const graph t& G)
void M.init(const graph t& G, E x)
makes M a mapping m from the set of all edges of G into
the set of variables of type E. The variables in the range
of m are initialized by a call of the default constructor of
type E.
makes M a mapping m from the set of all edges of G into
the set of variables of type E. The variables in the range
of m are initialized with a copy of x.