Definition
A parameterized undirected graph G is an undirected graph whose nodes and edges contain additional (user defined) data (cf. Parameterized Graphs). 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<vtype,etype> | U | creates an instance U of type ugraph and initializes it to the empty undirected graph. |
Operations
see section Parameterized Graphs.
Implementation
see section Parameterized Graphs.