Circular Class Reference
[Layout]

#include <Circular.h>

List of all members.


Detailed Description

Circular.h - An implementation of a circurlar layout.

This plugin is an implementation of a circular layout that takes node size into account. It manages size of nodes and use a standard dfs for ordering nodes or search the maximum length cycle.

HISTORY:

25/11/2004 version 0.0.2: size and order 01/12/1999 Version 0.0.1: Initial release

NOTES:

This work on general graphs. Let n be the number of nodes, the algorithm complexity is in O(n). If the search_cycle is enabled, the complexity is exponential (NP-Complete problem !).

AUTHORS:

David Auber and Romain Bourqui University Bordeaux I France: Email:auber@tulip-software.org Daniel Archambault The University of British Columbia: Email: archam@cs.ubc.ca


Public Member Functions

 Circular (const tlp::PropertyContext &)
bool run ()


Constructor & Destructor Documentation

Circular::Circular const tlp::PropertyContext &   ) 
 


Member Function Documentation

bool Circular::run  ) 
 


Generated on Fri Jan 5 14:21:36 2007 for Tulip Plugins by  doxygen 1.4.6