SCCMAP(1) General Commands Manual SCCMAP(1)NAME
sccmap - extract strongly connected components of directed graphs
SYNOPSIS
sccmap [-dsv] [ -ooutfile ] [ files ]
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 con-
nected components are printed to standard error. sccmap is a way of partitioning large graphs into more manageable pieces.
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.
-S Just print the resulting graphs. No statistics are printed.
-ooutput
Prints output to the file output. If not given, sccmap uses stdout.
-v Generate additional statistics. In particular, sccmap prints the number of nodes, edges, connected components, and strongly con-
nected 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.
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.
DIAGNOSTICS
sccmap emits a warning if it encounters an undirected graph, and ignores it.
AUTHORS
Stephen C. North <north@research.att.com>
Emden R. Gansner <erg@research.att.com>
SEE ALSO gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3)
21 March 2001 SCCMAP(1)
Check Out this Related Man Page
CCOMPS(1) General Commands Manual CCOMPS(1)NAME
ccomps - connected components filter for graphs
SYNOPSIS
ccomps [ -sxvnzC? ] [ -X[#]v ] [ -ooutfile ] [ files ]
DESCRIPTION
ccomps decomposes graphs into their connected components, printing the components to standard output.
OPTIONS
The following options are supported:
-s No output graph is printed. The return value can be used to check if the graph is connected or not.
-x Only the connected components are printed, as separate graphs.
-v Counts of nodes, edges and connected components are printed.
-z Sort components by size, with the largest first. This is only effective if either -x or -X#v is present. Thus, -zX#0 will cause the
largest component to be printed.
-C Use clusters in computing components in addition to normal edge connectivity. In essence, this gives the connected components of the
derived graph in which nodes top-level clusters and nodes in the original graph. This maintains all subgraph structure within a com-
ponent, even if a subgraph does not contain any nodes.
-n Do not project subgraph structure. Normally, if ccomps produces components as graphs distinct from the input graph, it will define
subgraphs which are projections of subgraphs of the input graph onto the component. (If the projection is empty, no subgraph is pro-
duced.) If this flag is set, the component contains only the relevant nodes and edges.
-X node_name
Prints only the component containing the node node_name, if any.
-X# index
Prints only component number index, if any, starting at 0.
-o outfile
If specified, each graph will be written to a different file with the names derived from outfile. In particular, if both -o and -x
flags are used, then each connected component is written to a different file. If outfile does not have a suffix, the first file will
have the name outfile; then next outfile_1, then next outfile_2, and so on. If outfile has a suffix, i.e., has the form base.sfx,
then the files will be named base.sfx, base_1.sfx, base_2.sfx, etc.
By default, each input graph is printed, with each connected component given as a subgraph whose name is a concatenation of the name of the
input graph, the string "_component_" and the number of the component.
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.
RETURN CODES
Unless used to extract a single connected component, ccomps returns 0 if all the input graphs are connected; and non-zero if any graph has
multiple components, or any error occurred. If just extracting a single component, ccomps returns 0 on success and non-zero if an error
occurred.
BUGS
It is possible, though unlikely, that the names used for connected components and their subgraphs may conflict with existing subgraph
names.
AUTHORS
Stephen C. North <north@research.att.com>
Emden R. Gansner <erg@research.att.com>
SEE ALSO gc(1), dot(1), gvpr(1), gvcolor(1), acyclic(1), sccmap(1), tred(1), libgraph(3)
27 August 2008 CCOMPS(1)