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] [ 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       -v     Generate additional statistics. In particular, sccmap prints the
28              number of nodes, edges, connected components, and strongly  con‐
29              nected  components,  followed by the fraction of nodes in a non-
30              trivial strongly connected components, the maximum degree of the
31              graph, and fraction of non-tree edges in the graph.
32

OPERANDS

34       The following operand is supported:
35
36       files   Names  of  files containing 1 or more graphs in dot format.  If
37               no files operand is specified, the standard input will be used.
38

DIAGNOSTICS

40       sccmap emits a warning  if  it  encounters  an  undirected  graph,  and
41       ignores it.
42

AUTHORS

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

SEE ALSO

48       gc(1),  dot(1),  acyclic(1),  gvpr(1),  gvcolor(1), ccomps(1), tred(1),
49       libgraph(3)
50
51
52
53                                 21 March 2001                       SCCMAP(1)