|
Daniel@0
|
1 .TH SCCMAP 1 "21 March 2001" \*(eX
|
|
Daniel@0
|
2 .SH NAME
|
|
Daniel@0
|
3 sccmap \- extract strongly connected components of directed graphs
|
|
Daniel@0
|
4 .SH SYNOPSIS
|
|
Daniel@0
|
5 \fBsccmap\fR
|
|
Daniel@0
|
6 [\fB\-dsv\fR]
|
|
Daniel@0
|
7 [
|
|
Daniel@0
|
8 .I files
|
|
Daniel@0
|
9 ]
|
|
Daniel@0
|
10 .SH DESCRIPTION
|
|
Daniel@0
|
11 .I sccmap
|
|
Daniel@0
|
12 decomposes digraphs into strongly connected components
|
|
Daniel@0
|
13 and an auxiliary map of the relationship between components.
|
|
Daniel@0
|
14 In this map, each component is collapsed into a node.
|
|
Daniel@0
|
15 The resulting graphs are printed to standard out.
|
|
Daniel@0
|
16 The number of nodes, edges and strongly connected components
|
|
Daniel@0
|
17 are printed to standard error.
|
|
Daniel@0
|
18 .B sccmap
|
|
Daniel@0
|
19 is a way of partitioning large graphs into more manageable pieces.
|
|
Daniel@0
|
20 .SH OPTIONS
|
|
Daniel@0
|
21 The following options are supported:
|
|
Daniel@0
|
22 .TP
|
|
Daniel@0
|
23 .B \-d
|
|
Daniel@0
|
24 Preserve degenerate components of only one node.
|
|
Daniel@0
|
25 .TP
|
|
Daniel@0
|
26 .B \-s
|
|
Daniel@0
|
27 Do not print the resulting graphs. Only the statistics are
|
|
Daniel@0
|
28 important.
|
|
Daniel@0
|
29 .TP
|
|
Daniel@0
|
30 .B \-S
|
|
Daniel@0
|
31 Just print the resulting graphs. No statistics are printed.
|
|
Daniel@0
|
32 .TP
|
|
Daniel@0
|
33 .B \-v
|
|
Daniel@0
|
34 Generate additional statistics. In particular,
|
|
Daniel@0
|
35 .B sccmap
|
|
Daniel@0
|
36 prints the number of nodes, edges, connected components,
|
|
Daniel@0
|
37 and strongly connected components, followed by the fraction of
|
|
Daniel@0
|
38 nodes in a non-trivial strongly connected components,
|
|
Daniel@0
|
39 the maximum degree of the graph, and fraction of non-tree edges
|
|
Daniel@0
|
40 in the graph.
|
|
Daniel@0
|
41 .SH OPERANDS
|
|
Daniel@0
|
42 The following operand is supported:
|
|
Daniel@0
|
43 .TP 8
|
|
Daniel@0
|
44 .I files
|
|
Daniel@0
|
45 Names of files containing 1 or more graphs in dot format.
|
|
Daniel@0
|
46 If no
|
|
Daniel@0
|
47 .I files
|
|
Daniel@0
|
48 operand is specified,
|
|
Daniel@0
|
49 the standard input will be used.
|
|
Daniel@0
|
50 .SH "DIAGNOSTICS"
|
|
Daniel@0
|
51 \fBsccmap\fP emits a warning if it encounters an undirected graph,
|
|
Daniel@0
|
52 and ignores it.
|
|
Daniel@0
|
53 .SH AUTHORS
|
|
Daniel@0
|
54 Stephen C. North <north@research.att.com>
|
|
Daniel@0
|
55 .br
|
|
Daniel@0
|
56 Emden R. Gansner <erg@research.att.com>
|
|
Daniel@0
|
57 .SH "SEE ALSO"
|
|
Daniel@0
|
58 gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3)
|
