treereingoldandtilfordextended(3)
NAME
TreeReingoldAndTilfordExtended - TreeReingoldAndTilfordExtended.h - An
implementation of a hierarchical tree layout.
SYNOPSIS
#include <TreeReingoldAndTilfordExtended.h> Public Member Functions TreeReingoldAndTilfordExtended (const tlp::PropertyContext &) ~TreeReingoldAndTilfordExtended () bool run ()
Detailed Description
TreeReingoldAndTilfordExtended.h - An implementation of a hierarchical
tree layout.
This plugin is an implementation of the hierarchical tree layout
algorithm first published as:
- E.M. Reingold and J.S. Tilford,
- 'Tidier Drawings of Trees',
'IEEE Transactions on Software Engineering'
pages '223--228'
1981 - HISTORY
- o 21/02/2000 Verson 0.0.1: Initial release
- o 06/11/2002 Verson 0.0.2: Documentation and code clean up
- o 06/01/2005 Verson 0.0.3: Code refactoring, management of :
- orienetation, parameters
- Note:
- This algorithm only works on trees.
Let n be the number of nodes, the algorithm complexity is in O(n). It extends the original Reingold and Tilford by providing
- managment of different node size and different edge length.
The algorithm use the (Size)'viewSize' property for element size - and the (int)'treeEdgeLength' for the edge length.
- Author:
- David Auber LaBRI, University Bordeaux I France, Email :
auber@tulip-software.org - LICENCE
- This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2 of the License, or (at your option) any later version.
Constructor & Destructor Documentation
- TreeReingoldAndTilfordExtended::TreeReingoldAndTilfordExtended (const
- tlp::PropertyContext &)
- TreeReingoldAndTilfordExtended::~TreeReingoldAndTilfordExtended ()
Member Function Documentation
bool TreeReingoldAndTilfordExtended::run ()
Author
- Generated automatically by Doxygen for Tulip Plugins Library from the
source code.