annotate toolboxes/graph_visualisation/share/man/man1/gc.1 @ 0:e9a9cd732c1e tip

first hg version after svn
author wolffd
date Tue, 10 Feb 2015 15:05:51 +0000
parents
children
rev   line source
wolffd@0 1 .TH GC 1 "21 March 2001"
wolffd@0 2 .SH NAME
wolffd@0 3 gc \- count graph components
wolffd@0 4 .SH SYNOPSIS
wolffd@0 5 .B gc
wolffd@0 6 [
wolffd@0 7 .B \-necCaDUrs?
wolffd@0 8 ]
wolffd@0 9 [
wolffd@0 10 .I files
wolffd@0 11 ]
wolffd@0 12 .SH DESCRIPTION
wolffd@0 13 .B gc
wolffd@0 14 is a graph analogue to
wolffd@0 15 .B wc
wolffd@0 16 in that it prints to standard output
wolffd@0 17 the number of nodes, edges, connected components or clusters contained
wolffd@0 18 in the input files.
wolffd@0 19 It also prints a total count for
wolffd@0 20 all graphs if more than one graph is given.
wolffd@0 21 .SH OPTIONS
wolffd@0 22 The following options are supported:
wolffd@0 23 .TP
wolffd@0 24 .B \-n
wolffd@0 25 Count nodes.
wolffd@0 26 .TP
wolffd@0 27 .B \-e
wolffd@0 28 Count edges.
wolffd@0 29 .TP
wolffd@0 30 .B \-c
wolffd@0 31 Count connected components.
wolffd@0 32 .TP
wolffd@0 33 .B \-C
wolffd@0 34 Count clusters. By definition, a cluster is a graph or
wolffd@0 35 subgraph whose name begins with "cluster".
wolffd@0 36 .TP
wolffd@0 37 .B \-a
wolffd@0 38 Count all. Equivalent to
wolffd@0 39 .B \-encC
wolffd@0 40 .TP
wolffd@0 41 .B \-r
wolffd@0 42 Recursively analyze subgraphs.
wolffd@0 43 .TP
wolffd@0 44 .B \-s
wolffd@0 45 Print no output. Only exit value is important.
wolffd@0 46 .TP
wolffd@0 47 .B \-D
wolffd@0 48 Only analyze directed graphs.
wolffd@0 49 .TP
wolffd@0 50 .B \-U
wolffd@0 51 Only analyze undirected graphs.
wolffd@0 52 .TP
wolffd@0 53 .B \-?
wolffd@0 54 Print usage information.
wolffd@0 55 .LP
wolffd@0 56 By default,
wolffd@0 57 .I gc
wolffd@0 58 returns the number of nodes and edges.
wolffd@0 59 .SH OPERANDS
wolffd@0 60 The following operand is supported:
wolffd@0 61 .TP 8
wolffd@0 62 .I files
wolffd@0 63 Names of files containing 1 or more graphs in dot format.
wolffd@0 64 If no
wolffd@0 65 .I files
wolffd@0 66 operand is specified,
wolffd@0 67 the standard input will be used.
wolffd@0 68 .SH "EXIT STATUS"
wolffd@0 69 The following exit values are returned:
wolffd@0 70 .TP 4
wolffd@0 71 .B 0
wolffd@0 72 Successful completion.
wolffd@0 73 .TP
wolffd@0 74 .B 1
wolffd@0 75 The
wolffd@0 76 .B \-U
wolffd@0 77 or
wolffd@0 78 .B \-E
wolffd@0 79 option was used, and a graph of the wrong type was encountered.
wolffd@0 80 .SH AUTHOR
wolffd@0 81 Emden R. Gansner <erg@research.att.com>
wolffd@0 82 .SH "SEE ALSO"
wolffd@0 83 wc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)