ccomps

Extract connected components from a graph

$ ccomps [input.dot] -o [output.dot]

$ ccomps -x [input.dot]

$ ccomps -X [prefix] [input.dot]

$ ccomps -z [input.dot]

$ ccomps -s [input.dot]

$ ccomps -C [node_name] [input.dot]

ccomps [options] [files]

ccomps is a Graphviz tool that decomposes graphs into their connected components. A connected component is a maximal subgraph in which any two vertices are connected by a path.
For undirected graphs, ccomps finds weakly connected components. For directed graphs, it can find either weakly connected (treating edges as undirected) or strongly connected components where every vertex is reachable from every other vertex.
The tool is useful for analyzing graph structure, extracting subgraphs, or preprocessing large graphs before layout.

-s

Silent mode, print only count of components.

Extract components, numbering subgraph names.

Write each component to prefix_N.dot files.

Sort by size, output only largest component.

Output only component containing named node.

Do not project subgraph structure.

Write output to file.

Verbose mode.

Print usage information.

Input must be in DOT format. For directed graphs, default behavior finds weakly connected components. Memory usage scales with graph size. Node names must be unique for -C option to work correctly.

ccomps is part of the Graphviz suite, originally developed at AT&T Labs Research starting in the early 1990s. Graphviz was created by Stephen North, Eleftherios Koutsofios, and others. The package was open-sourced in 2000. Graphviz tools including ccomps continue to be maintained as part of the standard graph visualization toolkit.

dot(1), neato(1), gc(1), gvpr(1)