Daniel@0: .TH SCCMAP 1 "21 March 2001" \*(eX
Daniel@0: .SH NAME
Daniel@0: sccmap \- extract strongly connected components of directed graphs
Daniel@0: .SH SYNOPSIS
Daniel@0: \fBsccmap\fR
Daniel@0: [\fB\-dsv\fR]
Daniel@0: [
Daniel@0: .I files
Daniel@0: ]
Daniel@0: .SH DESCRIPTION
Daniel@0: .I sccmap
Daniel@0: decomposes digraphs into strongly connected components
Daniel@0: and an auxiliary map of the relationship between components.
Daniel@0: In this map, each component is collapsed into a node.
Daniel@0: The resulting graphs are printed to standard out.
Daniel@0: The number of nodes, edges and strongly connected components
Daniel@0: are printed to standard error.
Daniel@0: .B sccmap
Daniel@0: is a way of partitioning large graphs into more manageable pieces.
Daniel@0: .SH OPTIONS
Daniel@0: The following options are supported:
Daniel@0: .TP
Daniel@0: .B \-d
Daniel@0: Preserve degenerate components of only one node.
Daniel@0: .TP
Daniel@0: .B \-s
Daniel@0: Do not print the resulting graphs. Only the statistics are
Daniel@0: important.
Daniel@0: .TP
Daniel@0: .B \-S
Daniel@0: Just print the resulting graphs. No statistics are printed.
Daniel@0: .TP
Daniel@0: .B \-v
Daniel@0: Generate additional statistics. In particular,
Daniel@0: .B sccmap
Daniel@0: prints the number of nodes, edges, connected components,
Daniel@0: and strongly connected components, followed by the fraction of
Daniel@0: nodes in a non-trivial strongly connected components,
Daniel@0: the maximum degree of the graph, and fraction of non-tree edges
Daniel@0: in the graph.
Daniel@0: .SH OPERANDS
Daniel@0: The following operand is supported:
Daniel@0: .TP 8
Daniel@0: .I files
Daniel@0: Names of files containing 1 or more graphs in dot format.
Daniel@0: If no
Daniel@0: .I files
Daniel@0: operand is specified,
Daniel@0: the standard input will be used.
Daniel@0: .SH "DIAGNOSTICS"
Daniel@0: \fBsccmap\fP emits a warning if it encounters an undirected graph,
Daniel@0: and ignores it.
Daniel@0: .SH AUTHORS
Daniel@0: Stephen C. North <north@research.att.com>
Daniel@0: .br
Daniel@0: Emden R. Gansner <erg@research.att.com>
Daniel@0: .SH "SEE ALSO"
Daniel@0: gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3)