From Wikux.org

Contents 1 SCCMAP 1.1 NAME 1.2 SYNOPSIS 1.3 DESCRIPTION 1.4 OPTIONS 1.5 OPERANDS 1.6 DIAGNOSTICS 1.7 AUTHORS 1.8 SEE ALSO

[edit] SCCMAP

Section: User Commands (1)
Updated: 21 March 2001
Index Return to Main Contents

---

[edit] NAME

sccmap - extract strongly connected components of directed graphs

[edit] SYNOPSIS

sccmap [-dsv] [ files ]

[edit] DESCRIPTION

sccmap decomposes 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 connected components are printed to standard error. sccmap is a way of partitioning large graphs into more manageable pieces.

[edit] OPTIONS

The following options are supported:

-d

Preserve degenerate components of only one node.

-s

Do not print the resulting graphs. Only the statistics are important.

-v

Generate additional statistics. In particular, sccmap prints the number of nodes, edges, connected components, and strongly connected 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.

[edit] OPERANDS

The following operand is supported:

files

Names of files containing 1 or more graphs in dot format. If no files operand is specified, the standard input will be used.

[edit] DIAGNOSTICS

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

[edit] AUTHORS

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

[edit] SEE ALSO

gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3)

---