Version 5.0 The LEDA User Manual

graph algorithms, i.e., algorithms accepting instances of any parametrized graph type as
argument.
#include < LEDA/graph/graph.h >
2. Types
GRAPH :: node value type
GRAPH :: edge value type
3. Creation
the type of node data (vtype).
the type of edge data (etype).
GRAPH G; creates an instance G of type GRAPH and initializes
it to the empty graph.
4. Operations
const vtype& G.inf(node v) returns the information of node v.
const vtype& G[node v]
returns a reference to G.inf(v).
const etype& G.inf(edge e) returns the information of edge e.
const etype& G[edge e]
returns a reference to G.inf(e).
node array& G.node data( ) makes the information associated with the nodes of G
available as a node array of type node array.
edge array& G.edge data( ) makes the information associated with the edges of G
available as an edge array of type edge array.
void G.assign(node v, const vtype& x)
void G.assign(edge e, const etype& x)
node G.new node(const vtype& x)
makes x the information of node v.
makes x the information of edge e.
adds a new node to G and returns it.
node
G.new node(node u, const vtype& x, int dir)
adds a new node v = to G and returns it. v
is inserted in front of (dir = leda :: before) or behind
(dir = leda ::behind) node u into the list of all nodes.