Circular

Langue: en

Version: 300023 (debian - 07/07/09)

Section: 3 (Bibliothèques de fonctions)

NAME

Circular -

SYNOPSIS


#include <Circular.h>

Public Member Functions


Circular (const tlp::PropertyContext &)

bool run ()

Detailed Description

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

Constructor & Destructor Documentation

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

Member Function Documentation

bool Circular::run ()

Author

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