Mercurial > hg > camir-aes2014

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

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
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 "27 March 2008"
wolffd@0 2 .SH NAME
wolffd@0 3 gvgen \- generate graphs
wolffd@0 4 .SH SYNOPSIS
wolffd@0 5 .B gvgen
wolffd@0 6 [
wolffd@0 7 .B \-d?
wolffd@0 8 ]
wolffd@0 9 [
wolffd@0 10 .BI -c n
wolffd@0 11 ]
wolffd@0 12 [
wolffd@0 13 .BI -C x,y
wolffd@0 14 ]
wolffd@0 15 [
wolffd@0 16 .BI -g [\fBf\fP]x,y
wolffd@0 17 ]
wolffd@0 18 [
wolffd@0 19 .BI -G [\fBf\fP]x,y
wolffd@0 20 ]
wolffd@0 21 [
wolffd@0 22 .BI -h n
wolffd@0 23 ]
wolffd@0 24 [
wolffd@0 25 .BI -k n
wolffd@0 26 ]
wolffd@0 27 [
wolffd@0 28 .BI -b x,y
wolffd@0 29 ]
wolffd@0 30 [
wolffd@0 31 .BI -p n
wolffd@0 32 ]
wolffd@0 33 [
wolffd@0 34 .BI -s n
wolffd@0 35 ]
wolffd@0 36 [
wolffd@0 37 .BI -S n
wolffd@0 38 ]
wolffd@0 39 [
wolffd@0 40 .BI -t n
wolffd@0 41 ]
wolffd@0 42 [
wolffd@0 43 .BI -T x,y
wolffd@0 44 ]
wolffd@0 45 [
wolffd@0 46 .BI -w n
wolffd@0 47 ]
wolffd@0 48 [
wolffd@0 49 .BI -o outfile
wolffd@0 50 ]
wolffd@0 51 .SH DESCRIPTION
wolffd@0 52 .B gvgen
wolffd@0 53 generates a variety of simple, regularly-structured abstract
wolffd@0 54 graphs.
wolffd@0 55 .SH OPTIONS
wolffd@0 56 The following options are supported:
wolffd@0 57 .TP
wolffd@0 58 .BI \-c " n"
wolffd@0 59 Generate a cycle with \fIn\fP vertices and edges.
wolffd@0 60 .TP
wolffd@0 61 .BI \-C " x,y"
wolffd@0 62 Generate an \fIx\fP by \fIy\fP cylinder.
wolffd@0 63 This will have \fIx*y\fP vertices and
wolffd@0 64 \fI2*x*y - y\fP edges.
wolffd@0 65 .TP
wolffd@0 66 .BI \-g " [\fBf\fP]x,y"
wolffd@0 67 Generate an \fIx\fP by \fIy\fP grid.
wolffd@0 68 If \fBf\fP is given, the grid is folded, with an edge
wolffd@0 69 attaching each pair of opposing corner vertices.
wolffd@0 70 This will have \fIx*y\fP vertices and
wolffd@0 71 \fI2*x*y - y - x\fP edges if unfolded and
wolffd@0 72 \fI2*x*y - y - x + 2\fP edges if folded.
wolffd@0 73 .TP
wolffd@0 74 .BI \-G " [\fBf\fP]x,y"
wolffd@0 75 Generate an \fIx\fP by \fIy\fP partial grid.
wolffd@0 76 If \fBf\fP is given, the grid is folded, with an edge
wolffd@0 77 attaching each pair of opposing corner vertices.
wolffd@0 78 This will have \fIx*y\fP vertices.
wolffd@0 79 .TP
wolffd@0 80 .BI \-h " n"
wolffd@0 81 Generate a hypercube of degree \fIn\fP.
wolffd@0 82 This will have \fI2^n\fP vertices and \fIn*2^(n-1)\fP edges.
wolffd@0 83 .TP
wolffd@0 84 .BI \-k " n"
wolffd@0 85 Generate a complete graph on \fIn\fP vertices with
wolffd@0 86 \fIn*(n-1)/2\fP edges.
wolffd@0 87 .TP
wolffd@0 88 .BI \-b " x,y"
wolffd@0 89 Generate a complete \fIx\fP by \fIy\fP bipartite graph.
wolffd@0 90 This will have \fIx+y\fP vertices and
wolffd@0 91 \fIx*y\fP edges.
wolffd@0 92 .TP
wolffd@0 93 .BI \-p " n"
wolffd@0 94 Generate a path on \fIn\fP vertices.
wolffd@0 95 This will have \fIn-1\fP edges.
wolffd@0 96 .TP
wolffd@0 97 .BI \-s " n"
wolffd@0 98 Generate a star on \fIn\fP vertices.
wolffd@0 99 This will have \fIn-1\fP edges.
wolffd@0 100 .TP
wolffd@0 101 .BI \-S " n"
wolffd@0 102 Generate a Sierpinski graph of order \fIn\fP.
wolffd@0 103 This will have \fI3*(3^(n-1) - 1)/2\fP vertices and
wolffd@0 104 \fI3^n\fP edges.
wolffd@0 105 .TP
wolffd@0 106 .BI \-t " n"
wolffd@0 107 Generate a binary tree of height \fIn\fP.
wolffd@0 108 This will have \fI2^n-1\fP vertices and
wolffd@0 109 \fI2^n-2\fP edges.
wolffd@0 110 .TP
wolffd@0 111 .BI \-T " x,y"
wolffd@0 112 Generate an \fIx\fP by \fIy\fP torus.
wolffd@0 113 This will have \fIx*y\fP vertices and
wolffd@0 114 \fI2*x*y\fP edges.
wolffd@0 115 .TP
wolffd@0 116 .BI \-w " n"
wolffd@0 117 Generate a path on \fIn\fP vertices.
wolffd@0 118 This will have \fIn-1\fP edges.
wolffd@0 119 .TP
wolffd@0 120 .BI \-o " outfile"
wolffd@0 121 If specified, the generated graph is written into the file
wolffd@0 122 .I outfile.
wolffd@0 123 Otherwise, the graph is written to standard out.
wolffd@0 124 .TP
wolffd@0 125 .B \-d
wolffd@0 126 Make the generated graph directed.
wolffd@0 127 .TP
wolffd@0 128 .B \-?
wolffd@0 129 Print usage information.
wolffd@0 130 .SH "EXIT STATUS"
wolffd@0 131 .B gvgen
wolffd@0 132 exits with 0 on successful completion,
wolffd@0 133 and exits with 1 if given an ill-formed or incorrect flag,
wolffd@0 134 or if the specified output file could not be opened.
wolffd@0 135 .SH AUTHOR
wolffd@0 136 Emden R. Gansner <erg@research.att.com>
wolffd@0 137 .SH "SEE ALSO"
wolffd@0 138 gc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)