Version 5.0 The LEDA User Manual

11.4 Undirected Graphs ( ugraph )
1. Definition
An instance U of the data type ugraph is an undirected graph as defined in section 11.1.
#include < LEDA/graph/ugraph.h >
2. Creation
ugraph U;
creates an instance U of type ugraph and initializes it to the empty
undirected graph.
ugraph U(const graph& G);
creates an instance U of type ugraph and initializes it with an undirected
copy of G.
3. Operations
see section 11.1.
4. Implementation
see section 11.1.
11.5 Parameterized Ugraph ( UGRAPH )
1. Definition
A parameterized undirected graph G is an undirected graph whose nodes and contain
additional (user defined) data (cf. 11.2). Every node contains an element of a data type
vtype, called the node type of G and every edge contains an element of a data type etype
called the edge type of G.
#include < LEDA/graph/ugraph.h >
UGRAPH U;
creates an instance U of type ugraph and initializes it to the empty
undirected graph.
2. Operations
see section 11.2.