static void tlp::TreeTest::cleanComputedTree (Graph * graph, Graph * tree) [static]Clean the graph from a tree previously computed with the computeRootedTree function

static Graph* tlp::TreeTest::computeTree (Graph * graph, Graph * rootGraph = 0, bool isConnected = false, PluginProgress * pluginProgress = 0) [static]Compute a rooted tree from the graph. The algorithm is the following

•

if the graph is a rooted tree, return the graph

•

if the graph is a free tree, return a rooted copy

•

if the graph is connected, make a copy return a rooted spanning tree of that copy

•

if the graph is not connected, make a copy, compute a tree for each of its connected components, add a simple source and return the copy.