sccmap(1) sccmap(1)

## NAME

sccmap - extract strongly connected components of directed graphs

## SYNOPSIS

sccmap[-dsv] [-ooutfile] [files]

## DESCRIPTION

sccmapdecomposes digraphs into strongly connected components and an auxiliary map of the relationship between components. In this map, each component is collapsed into a node. The resulting graphs are printed to standard out. The number of nodes, edges and strongly con- nected components are printed to standard error.sccmapis a way of partitioning large graphs into more manageable pieces.

## OPTIONS

The following options are supported:-dPreserve degenerate components of only one node.-sDo not print the resulting graphs. Only the statistics are important.-SJust print the resulting graphs. No statistics are printed.-ooutputPrints output to the fileoutput. If not given,sccmapuses std- out.-vGenerate additional statistics. In particular,sccmapprints the number of nodes, edges, connected components, and strongly con- nected components, followed by the fraction of nodes in a non- trivial strongly connected components, the maximum degree of the graph, and fraction of non-tree edges in the graph.

## OPERANDS

The following operand is supported:filesNames of files containing 1 or more graphs in dot format. If nofilesoperand is specified, the standard input will be used.

## DIAGNOSTICS

sccmapemits a warning if it encounters an undirected graph, and ignores it.

## AUTHORS

Stephen C. North <north@research.att.com> Emden R. Gansner <erg@research.att.com>

## SEE ALSO

gc(1),dot(1),acyclic(1),gvpr(1),gvcolor(1),ccomps(1),tred(1),libgraph(3)21 March 2001 sccmap(1)

graphviz 2.40.1 - Generated Sat Jan 7 11:56:12 CST 2017