Drawing Trees and Tree-like Networks
About tree graph drawing styles and their different arrangement strategies
A tree graph drawing algorithm arranges graphs that are trees (i.e., graphs in which any two nodes are connected by exactly one path) and, thus, reveals the inherent hierarchic structure.
Such structures often appear in application areas like business administration, data-flow analysis, software engineering, and bioinformatics.
The main selling point for tree graph drawing algorithms is the edge-crossing-free arrangements produced by this class of algorithms. The result is a clear and concise diagram where relations between elements are easy to recognize and understand. Moreover, tree algorithms are usually quick and, thus, well-suited for large (tree-structured) data sets.
yFiles provides a highly customizable tree drawing algorithm called Tree Layout. At its core, the algorithm delegates the main aspects of layout calculation to interchangeable placement strategies. Not only are there several pre-defined placement strategies included with yFiles, but it is also possible to create custom strategies to support a vast range of different arrangements.
In addition to interchangeable placement strategies, the Tree Layout supports the following features:
Different node sizes and minimum edge lengths
Labels at nodes and edges
Orthogonal and polyline edge paths
Bus-style edge paths
Aspect-ratio driven arrangement