Graph Drawing in TikZ

  • Till Tantau
Conference paper

DOI: 10.1007/978-3-642-36763-2_46

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7704)
Cite this paper as:
Tantau T. (2013) Graph Drawing in TikZ. In: Didimo W., Patrignani M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg


At the heart of every good graph drawing algorithm lies an efficient procedure for assigning canvas positions to a graph’s nodes and the bend points of its edges. However, every real-world implementation of such an algorithm must address numerous problems that have little to do with the actual algorithm, like handling input and output formats, formatting node texts, and styling nodes and edges. We present a new framework, implemented in the Lua programming language and integrated into the TikZ graphics description language, that aims at simplifying the implementation of graph drawing algorithms. Implementers using the framework can focus on the core algorithmic ideas and will automatically profit from the framework’s pre- and post-processing steps as well as from the extensive capabilities of the TikZ graphics language and the \({\hbox{\TeX}}\) typesetting engine. Algorithms already implemented using the framework include the Reingold-Tilford tree drawing algorithm, a modular version of Sugiyama’s layered algorithm, and several force-based multilevel algorithms.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Till Tantau
    • 1
  1. 1.Institute for Theoretical Computer ScienceUniversität zu LübeckLübeckGermany

Personalised recommendations