20 #ifndef TULIP_TREETEST_H 
   21 #define TULIP_TREETEST_H 
   23 #include <tulip/tulipconf.h> 
PluginProcess subclasses are meant to notify about the progress state of some process (typically a pl...
 
Performs test to check whether a graph is a simple or rooted tree. From wikipedia: "A tree is an undi...
 
static void cleanComputedTree(Graph *graph, Graph *tree)
Removes subgraphs created during tree computation. If graph and tree are the same graph,...
 
static bool isFreeTree(const Graph *graph)
Checks if the graph is a topological tree (i.e. if the graph was undirected, there would be no cycle)...
 
static Graph * computeTree(Graph *graph, PluginProgress *pluginProgress=nullptr)
Computes a rooted tree from the graph. If the graph is a rooted tree, the input graph is returned as ...
 
static void makeRootedTree(Graph *freeTree, node root)
Makes a free tree into a rooted tree.
 
static bool isTree(const Graph *graph)
Checks if the graph is a rooted tree (i.e. one node is designated as the root).
 
The node struct represents a node in a Graph object.