Class for testing if the graph is a tree. More...
Inheritance diagram for tlp::TreeTest:
Collaboration diagram for tlp::TreeTest:
Class for testing if the graph is a tree.
Member Function Documentation
Clean the graph from a tree previously computed with the computeTree method
Computes a rooted tree from the graph. The algorithm is the following :
Returns true if the graph is a topological tree (i.e. if the graph was undirected, there would be no cycle), false otherwise.
Returns true if the graph is a rooted tree (i.e. a graph with one node designated as the root), false otherwise.
Synonymous of the makeRootedTree method.
|Tulip Software by LaBRI Visualization Team 2001 - 2012|