class tlp::AcyclicTest Class for testing if the graph is acyclic.
class tlp::BiconnectedTest class for testing if the graph is biconnected
class tlp::ConnectedTest class for testing if the graph is connected
class tlp::OuterPlanarTest class for testing the outerplanarity of a graph
class tlp::PlanarityTest class for testing the planarity of a graph
class tlp::SimpleTest
class tlp::TreeTest Class for testing if the graph is a tree.
class tlp::TriconnectedTest class for testing if a graph is triconnected
static void tlp::BiconnectedTest::makeBiconnected (Graph * graph, std::vector< edge > & addedEdges) [static, inherited]If the graph is not biconnected, add edges in order to make the graph biconnected. The new edges are added in addedEdges.
static void tlp::ConnectedTest::makeConnected (Graph * graph, std::vector< edge > & addedEdges) [static, inherited]If the graph is not connected, adds edges in order to make the graph connected. The new edges are added in addedEdges.
static unsigned int tlp::ConnectedTest::numberOfConnectedComponents (Graph * graph) [static, inherited]Returns the number of connected components in the graph;
Variable Documentation
edge tlp::SelfLoops::e1 [inherited]
edge tlp::SelfLoops::e2 [inherited]
edge tlp::SelfLoops::e3 [inherited]
node tlp::SelfLoops::n1 [inherited]
node tlp::SelfLoops::n2 [inherited]
edge tlp::SelfLoops::old [inherited]
Author
Generated automatically by Doxygen for Tulip Graph Library from the source code.