OGDF
OGDF Open Graph Drawing Framework. Many aspects of graph drawing research are motivated from practice, and practical evaluation of graph drawing algorithms is essential. However, graph drawing has now grown for several decades and a huge amount of algorithms for various drawing styles and applications has been proposed. Many sophisticated algorithms build upon complex data structures and other algorithms, thus making new implementations from scratch cumbersome and time-consuming. Obviously, graph drawing libraries can ease the implementation of new algorithms a lot. The LEDA-based C++-library AGD was very popular in the past, since it covers a wide range of graph drawing algorithms. However, the lack of publicly available source-code restricted the portability and extendability, not to mention the understanding of the particular implementations. Other currently available graph drawing libraries suffer from the same problems, or are even only commercially available or focus only on special graph layout methods. Our goals for the Open Graph Drawing Framework (OGDF) were to transfer essential design concepts of AGD and to overcome its main deficiencies for use in academic research. The library provides: A wide range of graph drawing algorithms that allow to reuse and replace particular algorithm phases by using a dedicated module mechanism. Sophisticated data structures that are commonly used in graph drawing, equipped with rich public interfaces. Self-contained code that does not require any additional libraries (except for some optional branch-and-cut algorithms). Portable C++-code that supports the most important compilers for Linux, MacOS, and Windows operating systems. Open source code available under the terms of the GNU General Public License version 2 or version 3.
Keywords for this software
References in zbMATH (referenced in 33 articles )
Showing results 1 to 20 of 33.
Sorted by year (- Schmidt, Daniel; Zey, Bernd; Margot, François: Stronger MIP formulations for the Steiner forest problem (2021)
- Chen, Fati; Piccinini, Laurent; Poncelet, Pascal; Sallaberry, Arnaud: Node overlap removal algorithms: an extended comparative study (2020)
- Clancy, Kieran; Haythorpe, Michael; Newcombe, Alex: A survey of graphs with known or bounded crossing numbers (2020)
- Bläsius, Thomas; Radermacher, Marcel; Rutter, Ignaz: How to draw a planarization (2019)
- De Luca, Felice; Di Giacomo, Emilio; Didimo, Walter; Kobourov, Stephen; Liotta, Giuseppe: An experimental study on the ply number of straight-line drawings (2019)
- Jünger, Michael; Mutzel, Petra; Spisla, Christiane: A flow formulation for horizontal coordinate assignment with prescribed width (2019)
- Mchedlidze, Tamara; Pak, Alexey; Klammler, Moritz: Aesthetic discrimination of graph layouts (2019)
- Ortali, Giacomo; Tollis, Ioannis G.: A new framework for hierarchical drawings (2019)
- Álvarez-Miranda, Eduardo; Luipersbeck, Martin; Sinnl, Markus: Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (2018)
- Chimani, Markus; Hedtke, Ivo; Wiedera, Tilo: Exact algorithms for the maximum planar subgraph problem: new models and experiments (2018)
- Chimani, Markus; Wiedera, Tilo: Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast (2018)
- Heinsohn, Niklas; Kaufmann, Michael: An interactive tool to explore and improve the ply number of drawings (2018)
- Klute, Fabian; Nöllenburg, Martin: Minimizing crossings in constrained two-sided circular graph layouts (2018)
- Alam, Md. Jawaherul; Kobourov, Stephen G.; Mondal, Debajyoti: Orthogonal layout with optimal face complexity (2017)
- Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus: Solving minimum-cost shared arborescence problems (2017)
- Calik, Hatice; Leitner, Markus; Luipersbeck, Martin: A Benders decomposition based framework for solving cable trench problems (2017)
- De Luca, Felice; Di Giacomo, Emilio; Didimo, Walter; Kobourov, Stephen; Liotta, Giuseppe: An experimental study on the ply number of straight-line drawings (2017)
- Fischetti, Matteo; Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Monaci, Michele; Resch, Max; Salvagnin, Domenico; Sinnl, Markus: Thinning out Steiner trees: a node-based model for uniform edge costs (2017)
- Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
- Arleo, Alessio; Didimo, Walter; Liotta, Giuseppe; Montecchiani, Fabrizio: A distributed multilevel force-directed algorithm (2016)
Further publications can be found at: http://www.ogdf.net/doku.php/ogdf:publications