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