Algorithmic Solutions > LEDA > LEDA Guide > Graph Algorithms > Graph Drawing Algorithms

Graph Drawing Algorithms

Graphs can be used to represent relational information. This is the reason why it is often useful to draw graphs in order to visualize this relational information. LEDA provides the following basic algorithms to draw graphs.
Example of Straight Line Embedding
Example of Visibility Representation
Example Tutte Embedding
Example Spring Embedding
Example Orthogonal Drawing
Example Series Parallel Graphs

See also:

Graph Algorithms

Graphs and Related Data Types


Manual Entries:

Manual Page Graph Drawing Algorithms




Please send any suggestions, comments or questions to leda@algorithmic-solutions.com
© Copyright 2001-2003, Algorithmic Solutions Software GmbH