Mr. Tree Layout Algorithm
This project is all about developing a tree layout algorithm. We pity the fool who doesn't use Mr. Tree Layout!
This page will over time be filled with documentation written by the project team. But first, here's some general information to get you started:
Project Team | - Sven Gundlach (sgu)
- Sven Oliver Reimers (sor)
|
Project Goals | The following are our main goals for this project: - Develop a good, robust tree-based layout algorithm that can be published and shipped as part of our KLay library.
- Supply good, useful documentation, both on this page (project-centric) as well as on a new page in the KIELER Wiki (user-centric).
|
Plug-in Name | de.cau.cs.kieler.klay.tree |
Repository | KIELER Pragmatics |
Branches | - Main tree layout branch:
prak/treelayout - Further development branches can be forked from the main tree layout branch; names should begin with prefix
prak/
|
Page Contents
Literature
Related publications:
Features
Mr.Tree is a layout algorithm that lays out a graph in a tree layout. It contains the following features:
- Support for connected components
- Support for node and edge labels
Some other features that can be thought of being implemented in the future:
- Support for graphs with cycles or other graphs that are hardly trees
- Support for ports
- Layout options for customizing the algorithm
- Different kinds of tree layouts (top-down tree, left-to-right tree, radial tree...)