# gen_at_graph(1) [debian man page]

GEN_AT_GRAPH(1) User Contributed Perl Documentation GEN_AT_GRAPH(1)NAME

gen_at_graph - generates a random graph for use in algotutor.SYNOPSIS

gen_at_graph [OPTION] ...DESCRIPTION

gen_at_graph generates a random graph for use in algotutor. Currently the only type of graph it can generate is a rectangular grid of vertices. Each vertex is connected to at most 8 adjacent vertices around it.OPTIONS

ROWS generate ROWS rows of vertices-rCOLS generate COLS columns of vertices-cWIDTH make each grid cell WIDTH pixel wide-wHEIGHT make each grid cell HEIGHT pixel high-hLOWER make all random numbers greater than or equal to LOWER-lUPPER make all random numbers less than (but never equal to) UPPER-uPATTERN specify the probability of generating each diagonal-dLICENSE

This code is distributed under the GNU General Public LicenseAUTHOR

Chao-Kuei Hung ckhung AT cyut DOT edu DOT twSEE ALSO

Please see /usr/share/doc/algotutor/doc/ for the full set of documentations.perl v5.10.12005-05-31 GEN_AT_GRAPH(1)

## Check Out this Related Man Page

GC(1) General Commands Manual GC(1)NAME

gvgen - generate graphsSYNOPSIS

gvgen [ -d? ] [] [-cn,y ] [ -g[f]x,y ] [ -G[f]x,y ] [-Cx] [-hn] [-kn,y ] [-bx] [-pn] [-sn] [-Sn] [-tn,y ] [-Tx] [-wn]-ooutfileDESCRIPTION

gvgen generates a variety of simple, regularly-structured abstract graphs.OPTIONS

The following options are supported:n Generate a cycle with n vertices and edges.-cx,y Generate an x by y cylinder. This will have x*y vertices and 2*x*y - y edges.-C[f]x,y Generate an x by y grid. If f is given, the grid is folded, with an edge attaching each pair of opposing corner vertices. This will have x*y vertices and 2*x*y - y - x edges if unfolded and 2*x*y - y - x + 2 edges if folded.-g[f]x,y Generate an x by y partial grid. If f is given, the grid is folded, with an edge attaching each pair of opposing corner vertices. This will have x*y vertices.-Gn Generate a hypercube of degree n. This will have 2^n vertices and n*2^(n-1) edges.-hn Generate a complete graph on n vertices with n*(n-1)/2 edges.-kx,y Generate a complete x by y bipartite graph. This will have x+y vertices and x*y edges.-bn Generate a path on n vertices. This will have n-1 edges.-pn Generate a star on n vertices. This will have n-1 edges.-sn Generate a Sierpinski graph of order n. This will have 3*(3^(n-1) - 1)/2 vertices and 3^n edges.-Sn Generate a binary tree of height n. This will have 2^n-1 vertices and 2^n-2 edges.-tx,y Generate an x by y torus. This will have x*y vertices and 2*x*y edges.-Tn Generate a path on n vertices. This will have n-1 edges.-woutfile If specified, the generated graph is written into the file outfile. Otherwise, the graph is written to standard out.-oMake the generated graph directed. -? Print usage information.-dEXIT STATUS

gvgen exits with 0 on successful completion, and exits with 1 if given an ill-formed or incorrect flag, or if the specified output file could not be opened.AUTHOR

Emden R. Gansner <erg@research.att.com>SEE ALSO

gc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3) 27 March 2008 GC(1)