#include <math.h>
#include <tulip/ForEach.h>
#include "Circular.h"
Include dependency graph for Circular.cpp:
Functions | |
LAYOUTPLUGINOFGROUP (Circular,"Circular","David Auber/ Daniel Archambault","25/11/2004","Ok","0","1","Basic") | |
void | dfsRecCall (Graph *sg, vector< node > &vec, MutableContainer< bool > &nodeVisited, node n) |
void | buildDfsOrdering (Graph *sg, vector< node > &vec) |
vector< node > | extractCycle (node n, deque< node > &st) |
void | dfs (node n, const Graph *sg, deque< node > &st, vector< node > &maxCycle, MutableContainer< bool > &flag, unsigned int &nbCalls, PluginProgress *pluginProgress) |
vector< node > | findMaxCycle (Graph *sg, PluginProgress *pluginProgress) |
double | computeRadius (const Size &s) |
Variables | |
const char * | paramHelp [] |
|
|
|
|
|
|
|
|
|
|
|
|
|
implementation of Circular (which is bubble circular). For nodes, history, author and licence please see the header file Circular.h |
|
Initial value: { HTML_HELP_OPEN() HTML_HELP_DEF( "type", "Size" ) HTML_HELP_DEF( "values", "An existing size property" ) HTML_HELP_DEF( "default", "viewSize" ) HTML_HELP_BODY() "This parameter defines the property used for node's sizes." HTML_HELP_CLOSE(), HTML_HELP_OPEN() HTML_HELP_DEF( "type", "bool" ) HTML_HELP_DEF( "values", "true/false" ) HTML_HELP_DEF( "default", "false" ) HTML_HELP_BODY() "If true search the maximum length cycle. Be careful, this problem is NP-Complete else order the node using a depth first search" } |