Stony Brook Algorithm Repository


Drawing Trees

Input
Output

Input Description: A tree (ie. graph without any cycles) \(T\).
Problem: A nice drawing of the tree \(T\).

Excerpt from The Algorithm Design Manual: There are as many reasons to want to draw trees as there are types of structures that trees represent. Consider software and debugging tools that illustrate the hierarchical structure of file system directories, or that trace the execution

The primary issue in drawing trees is establishing whether you are drawing free or rooted trees:


Implementations

Graphviz (rating 10)
treant-js (rating 7)
GraphEd (rating 7)
Combinatorica (rating 6)
pymag-trees (rating 5)
GED (rating 5)
Genocop (rating 5)


Recommended Books

Handbook of Graph Drawing and Visualization by R. Tamassia Graph Drawing Software by Michael Jünger and Petra Mutzel Drawing Graphs: Methods and Models by M. Kaufmann and D. Wagner
Graph Drawing: Algorithms for the Visualization of Graphs by Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ionnis G. Tollis Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica by S. Pemmaraju and S. Skiena

Related Problems


Drawing Graphs Nicely

Planarity Detection and Embedding

Go To Main Page