Version 5.0 The LEDA User Manual

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