gc man page
gc — count graph components
gc [ -necCaDUrsv? ] [ files ]
gc is a graph analogue to wc in that it prints to standard output the number of nodes, edges, connected components or clusters contained in the input files. It also prints a total count for all graphs if more than one graph is given.
The following options are supported:
Count connected components.
Count clusters. By definition, a cluster is a graph or subgraph whose name begins with "cluster".
Count all. Equivalent to -encC
Recursively analyze subgraphs.
Print no output. Only exit value is important.
Only analyze directed graphs.
Only analyze undirected graphs.
Print usage information.
By default, gc returns the number of nodes and edges.
The following operand is supported:
Names of files containing 1 or more graphs in dot format. If no files operand is specified, the standard input will be used.
The following exit values are returned:
The -U or -E option was used, and a graph of the wrong type was encountered.
Emden R. Gansner <firstname.lastname@example.org>
wc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)
acyclic(1), bcomps(1), ccomps(1), gvcolor(1), gvgen(1), gvpr(1), sccmap(1), tred(1), unflatten(1).