sccmap(1) [opensolaris man page]
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
BCOMPS(1) General Commands Manual BCOMPS(1) NAME
bcomps - biconnected components filter for graphs SYNOPSIS
bcomps [ -stvx? ] [ -ooutfile ] [ files ] DESCRIPTION
bcomps decomposes graphs into their biconnected components, printing the components to standard output. OPTIONS
The following options are supported: -s No output graph is printed. Implies the -v flag. -t Print the underlying block-cutvertex tree. -x Each biconnected component is printed as a separate root graph. -v Prints number of blocks and cutvertices. -o outfile If specified, each root 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 block is written to a different file. If outfile does not have a suffix, the nth block of the ith graph is written to outfile_n_i. However, the 0th block of the 0th graph is written to outfile. If outfile has a suffix, i.e., has the form base.sfx, then the files will have the same name as above, except appended with .sfx. The block-cutvertex tree of ith graph is written to outfile_n_T, with an appended suffix if specified. By default, each input graph is printed, with each block given as a subgraph whose name is a concatenation of the name of the input graph, the string "_bcc_" and the number of the block. 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
bcomps returns 0 if all the input graphs are biconnected; and non-zero if any graph has multiple blocks, or any 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
Emden R. Gansner <erg@research.att.com> SEE ALSO
ccomps(1), gc(1), dot(1), gvpr(1), gvcolor(1), acyclic(1), sccmap(1), tred(1), libgraph(3) 18 November 2003 BCOMPS(1)