1SCCMAP(1)                   General Commands Manual                  SCCMAP(1)
2
3
4

NAME

6       sccmap - extract strongly connected components of directed graphs
7

SYNOPSIS

9       sccmap [-dsv] [ -ooutfile ] [ files ]
10

DESCRIPTION

12       sccmap  decomposes  digraphs  into strongly connected components and an
13       auxiliary map of the relationship between  components.   In  this  map,
14       each  component  is  collapsed  into  a node.  The resulting graphs are
15       printed to standard out.  The number of nodes, edges and strongly  con‐
16       nected  components  are  printed to standard error.  sccmap is a way of
17       partitioning large graphs into more manageable pieces.
18

OPTIONS

20       The following options are supported:
21
22       -d     Preserve degenerate components of only one node.
23
24       -s     Do not print the  resulting  graphs.  Only  the  statistics  are
25              important.
26
27       -S     Just print the resulting graphs. No statistics are printed.
28
29       -ooutput
30              Prints output to the file output. If not given, sccmap uses std‐
31              out.
32
33       -v     Generate additional statistics. In particular, sccmap prints the
34              number  of nodes, edges, connected components, and strongly con‐
35              nected components, followed by the fraction of nodes in  a  non-
36              trivial strongly connected components, the maximum degree of the
37              graph, and fraction of non-tree edges in the graph.
38

OPERANDS

40       The following operand is supported:
41
42       files   Names of files containing 1 or more graphs in dot  format.   If
43               no files operand is specified, the standard input will be used.
44

DIAGNOSTICS

46       sccmap  emits  a  warning  if  it  encounters  an undirected graph, and
47       ignores it.
48

AUTHORS

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

SEE ALSO

54       gc(1), dot(1), acyclic(1),  gvpr(1),  gvcolor(1),  ccomps(1),  tred(1),
55       libgraph(3)
56
57
58
59                                 21 March 2001                       SCCMAP(1)