Open Graph Drawing Framework
current version:
v.2015.05 (Baobab)


May 30th, 2015: OGDF v2015.05 (Baobab) released

Today, we released the new version v2015.05 (Baobab) of OGDF! The release introduces various new algorithms and modules but also improves usability and elegance. To accomplish the latter, some changes had to be made that break compatibility to Sakura. Also, COIN-OR and ABACUS are now included in the OGDF package to make every feature work out-of-the-box. For a list of interesting new features, refer to the version history. For a list of compatibility-breaking changes, see the porting guide.

In parallel to the release of Baobab, we uploaded a new snapshot of OGDF. It marks the start in using C++11 features and the CMake build system. Note that you will need much more recent compilers to compile the snapshot than you would need for the Baobab release or former releases.

See the download page for more information on Baobab and the snapshots.

February 25th, 2014: OGDF accepted at Google Summer of Code 2014

GSoC 2014

OGDF has been accepted as a mentoring organization for the Google Summer of Code (GSoC) 2014! We are looking forward to see many student applications this year, and to get many great projects.

If you are interested in our projects, please have a look at the following web pages:

November 19th, 2013: Google Summer of Code has Finished

This year, the Google Summer of Code program funded 5 students to contribute to OGDF. Four of them successfully passed the final evaluation. As a result of their projects, the following new features are added to OGDF:

Paweł Schmidt implemented a new approach for k-layer crossing minimization, which seamlessly integrates with OGDF's SugiyamaLayout algorithm. A user can now choose between the original LayerByLayerSweep and the new GlobalSifting and GridSifting implementations by simply setting the corresponding module option of SugiyamaLayout. These new implementations assure that OGDF provides state-of-the-art algorithms for crossing minimization within the widely used Sugiyama framework.

Dzmitry Sledneu implemented the EmbedderOptimalFlexDraw class providing a polynomial-time algorithm for optimal bend minimization of graphs with maximum degree 4 where the first bend is for free. The algorithm is described in Optimal Orthogonal Graph Drawing with Convex Bend Costs by Bläsius, Rutter and Wagner (2012).

Łukasz Hanuszczak added read and write support for various fileformats. OGDF's GraphIO class is now capable of reading and writing the native file formats of the popular open-source tools GraphViz, Gephi and Tulip. He furthermore added support for file formats like GraphML, GDF and UCINET's DL. Although there may always be compatibility issues due to different design and purpose, this is a great step towards interoperability with other graph visualization and analysis tools (like yEd, Cytoscape, Canviz, OmniGraffle, GUESS, UCINET, igraph and GraphExplorer).

Saheb Motiani ported OGDF to JavaScript so it can be used on virtually any JavaScript platform, including your Browser and Node.js. Thanks to asm.js the speed is quite decent: it's about twice as slow as the native, single-threaded version. The port was done using the C++-to-JavaScript compiler Emscripten, thus maintenance and binding more functionality will be easy. You can try the demo or use OGDF.js right away. The code is still experimental.

A snapshot with these changes (except the JavaScript port) can be downloaded.

We hope the students had as much fun participating in GSoC as we did. We would be glad if they continue contributing to OGDF, and may their experience be useful for their future. Paweł, Dzmitry, Łukasz, Saheb, thank you very much for your time, efforts, energy, and results!

Last but not least, the Google Open Source Program Office has already announced Google Summer of Code 2014. The OGDF project is looking forward to being a part of it again.

May 28th, 2013: Accepted Students and Projects for GSoC 2013 Announced

OGDF is proud to announce that OGDF received five students for the Google Summer of Code 2013. These students will work on various projects ranging from implementing algorithms for particular phases of layout algorithms to projects that will highly improve OGDF's usability.

The complete list of students and projects can be found here.

We congratulate all the accepted students!

April 9th, 2013: OGDF weekly Snapshots Have Started

Starting with today we release weekly snapshots of the current development branch as a preview for the upcoming releases. They can be obtained from our download page. One major highlight included in the current snapshots (as well as the next release) is that we now include required third-party code (COIN and ABACUS) in the download package, and building OGDF will also build this code and automatically configure OGDF to use COIN and ABACUS.

The weekly builds contain some code-breaking changes that will be part of the next release. The Porting Guide explains these changes and how to rewrite source code written for OGDF v.2012.07 (Sakura). We also use a revised configuration system, please refer to the new installation instructions (Visual Studio and Linux/Mac).

April 8th, 2013: OGDF accepted at Google Summer of Code 2013

GSoC 2013

OGDF has been accepted as a mentoring organization for the Google Summer of Code (GSoC) 2013! We have a special web page with project ideas and further information for interested students.

We are looking forward to see many student applications this year, and to get many great projects.

July 18th, 2012: OGDF v.2012.07 (Sakura) released

Today, we released the new version v.2012.07 (Sakura) of OGDF! This release is mainly a clean-up and bug-fix release, bringing support for new compilers and fixing some annoying bugs. The highlights are:

  • Improved compiler support:
    • Support for the latest compiler versions (gcc 4.7, Visual Studio 2012) and new compilers (MinGW, LLVM/clang).
    • Adjusted generated project files for Visual Studio, so that source files can now be compiled in parallel.
    • Support for shared libraries (DLLs for Visual Studio 2008-2012, shared libraries for gcc, LLVM/clang).
  • Clean-up of classes for planarity testing and embedding.
  • PlanarStraightLayout and PlanarDrawLayout now have a module option for the embedder.
  • Various important bugfixes:
    • Fixed crashes when compiling with gcc and -O2 or -O3. By default, OGDF release builds now use -O2.
    • Fixed crashes of some embedder modules when the input graph contained blocks just consisting of two parallel edges.
    • Fixed a bug in the special handling of isolated nodes when minimizing crossings with SugiyamaLayout. Previous code did not work as intended, the revised code can decrease the number of crossings in many cases.

For a complete list of changes, please refer to the version history and Sakura's change-log.

May 10th, 2012: OGDF v.2012.05 (Madrona) released

Today, we released the new version v2012.05 (Madrona) of OGDF! This release brings various new algorithms and modules, as well as bug fixes and adaptions for current compilers. The highlights are:

  • First implementation of the approximation algorithm for multi-edge insertion (class MultiEdgeApproxInserter).
  • New planar straight-line layout methods: de Faysseix, Pack, Pollack (class FPPLayout) and Schnyder (class SchnyderLayout).
  • Various new modules to be used with SugiyamaLayout:
    • New two-layer crossing minimization heuristics based on sifting (class SiftingHeuristic) and greedy approaches (classes GreedyInsertHeuristic and GreedySwitchHeuristic).
    • New ranking module based on the Coffman-Graham algorithm (class CoffmanGrahamRanking).
    • New module for coordinate assignment based on the algorithm by Brandes and Köpf (class FastSimpleHierarchyLayout).
  • New Union/Find data structure (class DisjointSets).
  • Support for some additional file formats (GD Challenge format, Chaco format).
  • Further graph generators ((toroidal) grid graphs, Petersen graphs, planar graphs).

For a complete list of changes, please refer to the version history and Madrona's change-log.

March 16th, 2012: OGDF accepted at Google Summer of Code 2012

GSoC 2012 OGDF has been accepted as a mentoring organization for the Google Summer of Code (GSoc) 2012! We have a special web page with project ideas and further information for interested students.

We are looking forward to see many student applications this year, and to get many great projects.

January 7th, 2011: gml2pic v1.1 released

rendering of edges with cubic Bézier curves We have released the first update of the gml2pic utility, which adds support for rendering edges as curved lines using Bézier curves and circular arcs. These curves are automatically computed from the given polylines in the GML file; see excerpt from a drwaing of unix-history-time.gml on the right.

The new features are as follows:

  • Automatic generation of curved lines from the given polyline in the GML file. You can chose between quadratic and cubic Bézier curves and circular arcs (options -curve and -curvedLength).
  • Support for additional node templates (i.e. node shapes): hexagon, rhombus, and trapeze.
  • Support for using file patterns when calling gml2pic, e.g. you can now write gml2pic graph*.gml for processing all graphs fulfilling the pattern g*.gml.
  • You can now specify an additional margin around the drawing (option -margin).
  • There is now an option for determining the amount of output, so you can chose between no output at all (useful when running a script) or some informative output (option -msg-level).
  • The binaries in the Windows installer package are now statically linked against Qt, so there is no need anymore to distribute Qt DLLs (this shrinks the size of the .msi).

You can download the new version v1.1 on gml2pic's homepage.

December 6th, 2010: gml2pic v1.0 released

example PNG produced by gml2pic Today, we released our first internal project based on OGDF. The program gml2pic is a command line utility for converting a drawing stored as GML file into graphics file, like e.g. a JPEG or PDF file. It works perfectly together with OGDF and allows to view layouts produced by OGDF layout algorithms in an easy way. Simply store the layout as GML file and call gml2pic for this file. The program also supports various graphical attributes (similar as GDE) like colors and line styles, different fonts and even rich text. Here are some highlights:

  • supports GML file format extensions as used by OGDF and GDE
  • drawing of nodes, edges, and clusters
  • supports line styles, colors, and width for nodes, edges, and clusters
  • flexible drawing of arrow heads scaled with respect to line width, with correct anchoring at node bounding boxes
  • drawing of rich text with formatting of font, style, color, and alignment
  • various bitmap formats (PNG, JPEG, TIFF), freely scalable bitmap size
  • anti-aliasing of lines and text in bitmap graphics
  • true vector graphics (SVG, PDF, EPS) with correct bounding boxes

Please have a look at gml2pic's homepage for further information. You will also find various examples there that have been produced by gml2pic.

There are also new forums at the OGDF forums page, where you can discuss anything related to programs and projects that use OGDF.

October 21st, 2010: OGDF v.2010.10 (Sassafras) released

Today, we released the new version v2010.10 (Sassafras) of OGDF! This release brings various new algorithms and features. The most important highlights are:

  • Basic multithreading support and a completely revised memory management, including a thread-safe pool-memory allocator.
  • 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 quad-tree 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).
  • Added support for OGML graph file format.
  • Exact algorithms for computing maximum planar and maximum c-planar subgraphs (classes MaximumPlanarSubgraph and MaximumCPlanarSubgraph).
  • Support for latest versions of Visual Studio and g++ compilers.

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

September 23rd, 2010: OGDF team wins Graph Drawing 2010 online challenge

To continue the tradition, the OGDF team has won again a first prize at this year's Graph Drawing conference in Konstanz, Germany. This time, the topic of the online challenge was to minimize the length of the longest edge in planar orthogonal drawings of 4-planar graphs. Prof. Mutzel used Martin Gronemann's Gryphon graph editor (unfortunately not publicly available yet) and a little moral support from last year's winner Hoi-Ming Wong. We're looking forward to see some more competition in next year's challenge, since this time only one team participated in the automatic category.

September 24th, 2009: OGDF team wins Graph Drawing 2009 online challenge

The OGDF team of TU Dortmund wins again the GD 2009 challenge in automatic upward crossing minimization at the Graph Drawing conference in Chicago, USA. We congratulate Hoi-Ming Wong and Karsten Klein for winning the first prize!

September 29th, 2008: OGDF team wins Graph Drawing 2008 online challenge

The OGDF team of TU Dortmund wins the GD 2008 challenge in automatic upward crossing minimization at the Graph Drawing conference in Heraklion, Crete. The winning software used ogdf's upward planarization algorithm, to be available in ogdf's upcoming Sassafras release, and achieved a perfect score of 6 out of 6 points. The competition also included the commercial software by Tom Sawyer as well as AT&T's GraphViz.

November 23rd, 2007: OGDF v.2007.11 (Bubinga) released

The second public release of OGDF has been released today. This release focuses on improved usability, but also contains new functionality. Highlights of the new release are:

  • A new algorithm for planar augmentation with fixed embedding, and extended functionality for drawing graphs with a given planar embedding.
  • A new class DualGraph for representing the geometric dual graph of a combinatorial embedding.
  • 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. Array-based classes have now an optional template parameter for the index type.
  • Unified naming conventions and interfaces; significantly improved documentation.
  • Improved build system, including support for compiling with Osi Coin in Visual Studio and creating projects for Visual Studio 2003.
  • The library is now licensed under GPL v2 or v3 (you have the choice) with special exceptions allowing to link against LP-solver libraries.

Please refer to the change-log for further details.

October 8th, 2007: Hotfix for Jacaranda released

The first hotfix v.2007.09_a for Jacaranda has been released and is available at the download page. It fixes a bug that occurs when using OGDF with Coin.

September 19th, 2007: online!

jacaranda.jpg The first public release of OGDF (v.2007.09, Codename “Jacaranda”) goes online, including this website, forum, and doxygen-documentation.

news.txt · Last modified: 2015/05/31 15:48 by stephan
This page is driven by DokuWiki