The following indented list describes the major classes in the GDT hierarchy, along with a brief description of the graph types they manage, and of the implemented algorithms. More details about each class are available in the reference manual.

Base class for directed, partially directed and undirected embedded graphs. It supports multiple edges between the same pair of nodes, preserves and allows to control the embedding.

Last update: July 31, 2002
Website design by INTEGRA Sistemi,