wolffd@0: .TH GC 1 "21 March 2001" wolffd@0: .SH NAME wolffd@0: gc \- count graph components wolffd@0: .SH SYNOPSIS wolffd@0: .B gc wolffd@0: [ wolffd@0: .B \-necCaDUrs? wolffd@0: ] wolffd@0: [ wolffd@0: .I files wolffd@0: ] wolffd@0: .SH DESCRIPTION wolffd@0: .B gc wolffd@0: is a graph analogue to wolffd@0: .B wc wolffd@0: in that it prints to standard output wolffd@0: the number of nodes, edges, connected components or clusters contained wolffd@0: in the input files. wolffd@0: It also prints a total count for wolffd@0: all graphs if more than one graph is given. wolffd@0: .SH OPTIONS wolffd@0: The following options are supported: wolffd@0: .TP wolffd@0: .B \-n wolffd@0: Count nodes. wolffd@0: .TP wolffd@0: .B \-e wolffd@0: Count edges. wolffd@0: .TP wolffd@0: .B \-c wolffd@0: Count connected components. wolffd@0: .TP wolffd@0: .B \-C wolffd@0: Count clusters. By definition, a cluster is a graph or wolffd@0: subgraph whose name begins with "cluster". wolffd@0: .TP wolffd@0: .B \-a wolffd@0: Count all. Equivalent to wolffd@0: .B \-encC wolffd@0: .TP wolffd@0: .B \-r wolffd@0: Recursively analyze subgraphs. wolffd@0: .TP wolffd@0: .B \-s wolffd@0: Print no output. Only exit value is important. wolffd@0: .TP wolffd@0: .B \-D wolffd@0: Only analyze directed graphs. wolffd@0: .TP wolffd@0: .B \-U wolffd@0: Only analyze undirected graphs. wolffd@0: .TP wolffd@0: .B \-? wolffd@0: Print usage information. wolffd@0: .LP wolffd@0: By default, wolffd@0: .I gc wolffd@0: returns the number of nodes and edges. wolffd@0: .SH OPERANDS wolffd@0: The following operand is supported: wolffd@0: .TP 8 wolffd@0: .I files wolffd@0: Names of files containing 1 or more graphs in dot format. wolffd@0: If no wolffd@0: .I files wolffd@0: operand is specified, wolffd@0: the standard input will be used. wolffd@0: .SH "EXIT STATUS" wolffd@0: The following exit values are returned: wolffd@0: .TP 4 wolffd@0: .B 0 wolffd@0: Successful completion. wolffd@0: .TP wolffd@0: .B 1 wolffd@0: The wolffd@0: .B \-U wolffd@0: or wolffd@0: .B \-E wolffd@0: option was used, and a graph of the wrong type was encountered. wolffd@0: .SH AUTHOR wolffd@0: Emden R. Gansner wolffd@0: .SH "SEE ALSO" wolffd@0: wc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)