Provided by: tulip-doc_3.1.2-2.3ubuntu3_all

**NAME**

tlp::TreeTest - Class for testing if the graph is a tree.

**SYNOPSIS**

#include <TreeTest.h> Inheritstlp::GraphObserver.StaticPublicMemberFunctionsstatic boolisTree(Graph*graph) static boolisFreeTree(Graph*graph) static voidmakeRootedTree(Graph*freeTree,noderoot) static voidmakeDirectedTree(Graph*freeTree,noderoot) staticGraph*computeTree(Graph*graph,Graph*rootGraph=0, bool isConnected=false,PluginProgress*pluginProgress=0) static voidcleanComputedTree(Graph*graph,Graph*tree)

**Detailed** **Description**

Class for testing if the graph is a tree.

**Member** **Function** **Documentation**

staticvoidtlp::TreeTest::cleanComputedTree(Graph*graph,Graph*tree)[static]CleanthegraphfromatreepreviouslycomputedwiththecomputeRootedTreefunctionstaticGraph*tlp::TreeTest::computeTree(Graph*graph,Graph*rootGraph=0,boolisConnected=false,PluginProgress*pluginProgress=0)[static]Computearootedtreefromthegraph.Thealgorithmisthefollowing· 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.staticbooltlp::TreeTest::isFreeTree(Graph*graph)[static]staticbooltlp::TreeTest::isTree(Graph*graph)[static]staticvoidtlp::TreeTest::makeDirectedTree(Graph*freeTree,noderoot)[inline,static]staticvoidtlp::TreeTest::makeRootedTree(Graph*freeTree,noderoot)[static]

**Author**

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