Graph_test
Classes
Functions
Variables
Function Documentation
| static bool tlp::AcyclicTest::acyclicTest |
( |
const Graph * |
, |
|
|
std::vector< edge > * |
obstructionEdges = 0 |
|
) |
[static, inherited] |
|
|
|
Return true if the graph is acyclic else false; if the graph is not acyclic use obstructionEdges variable to store all edges that create cycle |
| static void tlp::ConnectedTest::computeConnectedComponents |
( |
Graph * |
graph, |
|
|
std::vector< std::set< node > > & |
components |
|
) |
[static, inherited] |
|
|
|
Compute the nodes for each connected component |
| static void tlp::AcyclicTest::makeAcyclic |
( |
Graph * |
graph, |
|
|
std::vector< edge > & |
reversed, |
|
|
std::vector< tlp::SelfLoops > & |
selfLoops |
|
) |
[static, inherited] |
|
|
|
Make the graph acyclic, by reversing edge direction (feedback arc set problem). If there is self loops a new node is added with two edges that points to it. |
| 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
|