1
.TH GC 1 "21 March 2001"
3
gc \- count graph components
14
is a graph analogue to
16
in that it prints to standard output
17
the number of nodes, edges, connected components or clusters contained
19
It also prints a total count for
20
all graphs if more than one graph is given.
22
The following options are supported:
31
Count connected components.
34
Count clusters. By definition, a cluster is a graph or
35
subgraph whose name begins with "cluster".
38
Count all. Equivalent to
42
Recursively analyze subgraphs.
45
Print no output. Only exit value is important.
48
Only analyze directed graphs.
51
Only analyze undirected graphs.
54
Print usage information.
58
returns the number of nodes and edges.
60
The following operand is supported:
63
Names of files containing 1 or more graphs in dot format.
67
the standard input will be used.
69
The following exit values are returned:
72
Successful completion.
79
option was used, and a graph of the wrong type was encountered.
81
Emden R. Gansner <erg@research.att.com>
83
wc(1), acyclic(1), gpr(1), ccomps(1), sccmap(1), tred(1), libgraph(3)