GDT provides a flexible architecture for managing constraints. Different types of constraint can be concurrently applied on nodes and edges, which are taken into account by the involved layout algorithms. The base undi_graph class provides in fact a set of methods for applying and removing constraints, which are then automatically propagated when the graph is promoted to any other derived class.

The following list describes the constraints currently available to the GDT developer. Constraints management is one of the most interesting and promising development area of the GDT project, and many more constraints should be available in the next released versions.

Base abstract class for representing a constraint. It declares as virtual the reaction methods common to all the derived constraint classes. Each specific constraint class provides in fact its own implementation, which depends on the semantics of the constraint itself.

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