Introduction
OGDF stands both for Open Graph Drawing Framework (the original name) and Open Graph algorithms and Data structures Framework.
OGDF is a C++ library for graph algorithms, in particular for (but not restricted to) automatic graph drawing. It offers sophisticated algorithms and data structures to use within your own applications or scientific projects. The library is self-contained; optionally, additional packages like LP-solvers are required for some implementations.
Here, you find the library's documentation. For more general information on OGDF see http://www.ogdf.net. There, you can also find further explanations, how-tos, and example code.
Overview
- Getting Started
Contains information how to build OGDF, how to port code to a more recent version of OGDF, etc.
- How-to Examples
- Basic Functionality
Contains basic general classes and functions for random numbers, date and time, fundamental classes and concepts like exception handling and comparer, as well as system-specific functionality like multi-threading support and access to information on system and configuration. There are also some noteworthy macros for developers.
- Graphs and Embeddings
Contains classes for representing graphs and combinatorial embeddings, as well as containers associated with them (e.g., node arrays), functionality for writing graphs in various file (and graphics) formats (see class ogdf::GraphIO), and graph generators.
- Graph Algorithms
Contains various general algorithms for graphs, digraphs, clustered graphs. More advanced algorithms deal with connectivity, shortest paths, flow, minimum spanning trees, Steiner trees, augmentation, and clustering.
- Graph Decomposition
- Graph Drawing
