Open Graph Drawing Framework
current version:
v.2010.10 (Sassafras)
     

Version History

v. 2010.10 (Sassafras)

Release Date: 21.10.2010

Download: ogdf.v2010.10.zip [2.10 MB]

Highlights:

  • Completely revised memory management; pool-memory allocator now supports thread-safe allocation.
  • Basic multithreading support for OGDF algorithms.
  • New class System provides methods for accessing system-dependent information and functionality (processor features, memory usage, file system).
  • New hierarchical graph layout method using upward planarization (class UpwardPlanarization); outperforms traditional Sugiyama-based methods with respect to crossings by far.
  • New multilevel layout algorithm (FastMultipoleMultilevelEmbedder), based on the multipole method, well-separated pair decomposition, and a new quadtree space partitioning (Martin Gronemann's Diploma thesis); makes use of SSE and multicore processors and is significantly faster than FMMMLayout.
  • New modular framework for multilevel graph layout (class ModularMultilevelMixer) with various options for coarsening, placement, and single-level layout.
  • New force-directed layout algorithms: Kamada-Kawai (class SpringEmbedderKK) and stress majorization (class StressMajorization).
  • New layout algorithms for directed graphs: DominanceLayout and VisibilityLayout.
  • Implementation of Prims' algorithm for minimum spanning tree computation.
  • Added support for OGML graph file format.
  • Exact algorithms for computing maximum planar and maximum c-planar subgraphs (classes MaximumPlanarSubgraph and MaximumCPlanarSubgraph).
  • OGDF can now be compiled as DLL under Windows.
  • Support for Visual Studio 2010 and latest g++ compilers.

For a complete list of changes, please refer to Sassafras' change-log.

v. 2007.11 (Bubinga)

Release Date: 23.11.2007

Download: ogdf.v2007.11.zip [1.61 MB]

Highlights:

  • New algorithm for planar augmentation with fixed embedding.
  • The planar drawing algorithms Planar-Straight, Planar-Draw, and Mixed-Model can now be called with a given planar embedding.
  • New class DualGraph representing the geometric dual graph of a combinatorial embedding.
  • Consistent interface for planarization layout that allows to call with GraphAttributes.
  • Sugiyama layout now produces drawings with given node ranks that are also respected across different connected components.
  • Hashing functions can now be passed as template parameters; the implementation of two-dimensional hash-arrays has been revised and allows now using different types for each index.
  • Optional template parameter for index type of array-based classes.
  • Unified naming conventions and interfaces.
  • Improved build system for Visual Studio, including support for compiling with Osi Coin and creating projects for Visual Studio 2003.
  • Significantly improved documentation.

For a complete list of changes, please refer to Bubinga's change-log.

v. 2007.09 (Jacaranda)

Release Date: 19.09.2007

Download: ogdf.v2007.09_a.zip [1.47 MB] (includes all hotfixes)

Hotfixes: hotfix-v2007.09_a.zip [7 KB] (released 08.10.2007)

Changes in Hotfix v2007.09_a:

  • Bug fix in LPSolver_coin.cpp: Wrong LP passed to Coin
  • Bug fix in coin.cpp: Pragma #warning not compatible with Visual C++

To install a hotfix unzip the hotfix in the root directory of the OGDF installation and recompile OGDF.

 
tech/versions.txt · Last modified: 2010/10/21 08:54 by carsten
This page is driven by DokuWiki