1GC(1)                       General Commands Manual                      GC(1)
2
3
4

NAME

6       gc - count graph components
7

SYNOPSIS

9       gc [ -necCaDUrsv?  ] [ files ]
10

DESCRIPTION

12       gc  is  a graph analogue to wc in that it prints to standard output the
13       number of nodes, edges, connected components or clusters  contained  in
14       the  input  files.  It also prints a total count for all graphs if more
15       than one graph is given.
16

OPTIONS

18       The following options are supported:
19
20       -n     Count nodes.
21
22       -e     Count edges.
23
24       -c     Count connected components.
25
26       -C     Count clusters. By definition, a cluster is a graph or  subgraph
27              whose name begins with "cluster".
28
29       -a     Count all. Equivalent to -encC
30
31       -r     Recursively analyze subgraphs.
32
33       -s     Print no output. Only exit value is important.
34
35       -D     Only analyze directed graphs.
36
37       -U     Only analyze undirected graphs.
38
39       -v     Verbose output.
40
41       -?     Print usage information.
42
43       By default, gc returns the number of nodes and edges.
44

OPERANDS

46       The following operand is supported:
47
48       files   Names  of  files containing 1 or more graphs in dot format.  If
49               no files operand is specified, the standard input will be used.
50

EXIT STATUS

52       The following exit values are returned:
53
54       0   Successful completion.
55
56       1   The -U or -E option was used, and a graph of  the  wrong  type  was
57           encountered.
58

AUTHOR

60       Emden R. Gansner <erg@research.att.com>
61

SEE ALSO

63       wc(1),  acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1),
64       libgraph(3)
65
66
67
68                                 21 March 2001                           GC(1)