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.
Base class for connected planar graphs with planar embedding. It enhances the undi_graph class with a wide set of face and face-border management methods.
Base class for directed planar graphs with an upward representation. It enhances the plan_undi_graph class with methods and data-structures for the upward representation. This class can be also used also to generate quasi-upward layouts.
Base class for connected planar graphs with planar embedding and orthogonal shape. It enhances the plan_undi_graph class with a wide set of bends, angles and shape management methods, including three different othogonalizers.
Base class for dimensioned, oriented and rectangolarized or regularized planar graphs with planar embedding and orthogonal shape. It enhances the orth_plan_undi_graph class with a wide set of geometry management methods, including a rectangularizer, a regularizer, and several different compactors.
Base class for handling a biconnected subgraph of a planar graph (owner graph) with additional virtual edges representing (and linking to) other split_components of the same owner graph. It enhances the plan_undi_graph class with methods for decomposing the owner graph into its split components and for navigating through such components (see also the SPQR_tree class).
Base class for handling a complete split component (i.e. a triconnected component of a planar graph) with a fixed reference edge, whose extremal nodes are named poles (see also the SPQR_tree class).
Base class for directed graphs. It enhances the undi_graph class by forcing edges to be directed, by providing new specific methods for directed graphs, and by overriding inherited methods in order to make them taking into account edge directions.
Base class for flow-nets. It enhances the dire_graph class with a set of flow-management methods, including a general implementation of the min-cost-flow algorithm , and an efficient one specifically designed for nets with non-negative costs.
Base class for tree graphs. It enhances the undi_graph class with a wide set of methods for handling herarchies, including root changing, BFS, DFS and post-order visit of subtrees.
Base class for SPQR-tree graphs. It enhances the tree class with a wide set of methods and ancillar classes for handling SPQR trees. An SPQR tree represents the decomposition of a planar graph into its triconnected components (i.e. Series/Parallel/Rigid skeletons), thus allowing an efficient generation of its embeddings (see also the skeleton class). This class is the first and only implementation of SPQR-trees we are aware of.
Last update: July 31, 2002
Website design by INTEGRA Sistemi, www.IntegraSistemi.it