ConeTreeExtended.h(3) An implementation of the cone tree layout.

Other Alias

ConeTreeExtended

SYNOPSIS


#include <ConeTreeExtended.h>

Public Member Functions


ConeTreeExtended (const tlp::PropertyContext &)

~ConeTreeExtended ()

bool run ()

Detailed Description

ConeTreeExtended.h - An implementation of the cone tree layout.

This plugin is an extension of the Cone tree layout algorithm first published as:

A. FJ. Carriere and R. Kazman,

 'Interacting with Huge Hierarchies: Beyond Cone Trees', 

 In Proceedings of InfoViz'95, 

 IEEE Symposium on Information Visualization 

 pages 74-78, 1995,

Information about the extension can be found in :

D.Auber, PhD Thesis, 'Outils de visualisation de larges structures de donnees', University Bordeaux, december 2002.

HISTORY

  • 01/04/99 Verson 0.0.1: Initial release

Note:

This algorithm only works on trees. Let n be the number of nodes, the algorithm complexity is in O(n).

Author:

David Auber University Bordeaux I France: Email:[email protected]

Constructor & Destructor Documentation

ConeTreeExtended::ConeTreeExtended (const tlp::PropertyContext &)

ConeTreeExtended::~ConeTreeExtended ()

Member Function Documentation

bool ConeTreeExtended::run ()

Author

Generated automatically by Doxygen for Tulip Plugins Library from the source code.