Connected components in a graph refer to a set of vertices that are connected to each other by direct or indirect paths. In other words, a set of vertices in a graph is a connected component if every node in the graph can be reached from every other node in the graph. In this recipe, you will learn about connected components and how you can run the algorithm to find connected components in Gephi on the graph of your choice.
The following steps illustrate the process to find the connected components in a graph:
Load the directed version of the Les Misérables network into Gephi.
Click on the Run button placed adjacent to Connected Components in the Network Overview tab of the Statistics panel. This opens up the Connected Components settings window.
Choose between the Directed and UnDirected versions of the graph. Running the connected components detection algorithm on undirected graphs will lead to detection of only the weakly connected components...