[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]

connected_components(+Graph, -ConnectedComponents)

Computes the connected components of graph
a graph structure
a list of lists of node numbers


Computes the connected components of a (bidirected) graph. Each resulting connected component is represented as an (unsorted) list of nodes.

This operation is only defined on bidirected graphs. The runtime complexity is O(Nnodes + Nedges).

Modes and Determinism

See Also

graph_is_bidirected / 1, articulation_points / 2