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