LinuxCommandLibrary
GitHubF-DroidGoogle Play Store

sccmap

Find strongly connected components in Graphviz graphs

TLDR

Find strongly connected components
$ sccmap [graph.dot]
copy
Output to file
$ sccmap -o [output.dot] [graph.dot]
copy
Show statistics
$ sccmap -v [graph.dot]
copy
Print number of nodes in each SCC
$ sccmap -S [graph.dot]
copy
Silent mode
$ sccmap -s [graph.dot]
copy

SYNOPSIS

sccmap [-dsSv] [-o file] [options] files

DESCRIPTION

sccmap decomposes directed graphs into their strongly connected components (SCCs), where each SCC is a maximal set of nodes in which every node is reachable from every other node. It reads DOT format graphs and outputs each component as a separate subgraph.With the -v flag, it reports statistics including the number and sizes of components, which is useful for understanding the structure of large directed graphs. Part of the Graphviz graph visualization package.

PARAMETERS

-o FILE

Output file.
-v
Verbose statistics.
-s
Silent mode.
-S
Print the number of nodes in each strongly connected component.
-d
Decompose the graph and number each node with its SCC index.

INSTALL

sudo apt install graphviz
copy
sudo dnf install graphviz
copy
sudo pacman -S graphviz
copy
sudo apk add graphviz
copy
sudo zypper install graphviz
copy
brew install graphviz
copy
nix profile install nixpkgs#graphviz
copy

CAVEATS

Directed graphs only. DOT format input. Part of Graphviz package.

HISTORY

sccmap is part of Graphviz, the graph visualization software developed at AT&T Labs Research.

SEE ALSO

dot(1), neato(1), tred(1), ccomps(1), acyclic(1)

Copied to clipboard
Kai