Tulip
5.2.1
Large graphs analysis and drawing

#include <BiconnectedTest.h>
Static Public Member Functions  
static bool  isBiconnected (const Graph *graph) 
static void  makeBiconnected (Graph *graph, std::vector< edge > &addedEdges) 
Performs a test of biconnexity on the graph, and provides a function to make a graph biconnected. From Wikipedia: "A biconnected graph is connected and nonseparable, meaning that if any vertex were to be removed, the graph will remain connected.".
Definition at line 36 of file BiconnectedTest.h.

static 
Checks whether the graph is biconnected (i.e. removing one edge does not disconnect the graph, at least two must be removed).
graph  The graph to check for biconnectivity. 

static 
Adds edges to make the graph biconnected.
If the graph is not biconnected, adds edges in order to make the graph biconnected. The new edges are added in addedEdges.
graph  The graph to make biconnected. 
addedEdges  The edges that were added in the process. 