20#ifndef TULIP_CONNECTEDTEST_H
21#define TULIP_CONNECTEDTEST_H
25#include <tulip/tulipconf.h>
79 std::vector<std::vector<node>> &components);
89 static void connect(
const Graph *
const, std::vector<node> &toLink);
Performs a test of connexity on the graph, and provides a function to make a graph connected....
static void computeConnectedComponents(const Graph *graph, std::vector< std::vector< node > > &components)
Computes the sets of connected components and stores the result in the components vector.
static bool isConnected(const Graph *const graph)
Checks if a graph is connected (i.e. there is a path between every pair of vertices).
static void makeConnected(Graph *graph, std::vector< edge > &addedEdges)
If the graph is not connected, adds edges to make it connected.
static unsigned int numberOfConnectedComponents(const Graph *const graph)
Gets the number of connected components in the graph.