bcomps

Decompose graph into biconnected components

$ bcomps [input.gv] > [output.gv]

$ bcomps -v [input.gv]

$ bcomps -x [input.gv]

$ bcomps -t [input.gv]

$ bcomps -o [output.gv] [input.gv]

$ bcomps -sv [input.gv]

bcomps [-stvx?] [-o outfile] [files]

bcomps decomposes graphs into their biconnected components, printing the components to standard output. A biconnected component is a maximal subgraph that remains connected after removal of any single vertex.
The tool is part of the Graphviz graph visualization suite and works with DOT language graph files.

-s

Silent mode; no output graph printed (implies -v)

Print the underlying block-cutvertex tree

Print number of blocks and cutvertices

Print each biconnected component as separate root graph

Write each root graph to different file derived from outfile

Display help information

By default, each input graph is printed with blocks as subgraphs. Subgraph names concatenate the input graph name, "bcc", and the block number.

0

All input graphs are biconnected

Any graph has multiple blocks or an error occurred

Input files must be in Graphviz DOT format. The tool identifies articulation points (cutvertices) that separate components. Large graphs may require significant processing time.

ccomps(1), gc(1), dot(1), gvpr(1), sccmap(1), tred(1), acyclic(1)