Man Linux: Main Page and Category List

gvgen - generate graphs

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

gvgengenerates a variety of simple, regularly-structured abstract graphs.

The following options are supported:-cnGenerate a cycle withnvertices and edges.-Cx,yGenerate anxbyycylinder. This will havex*yvertices and2*x*y-yedges.-g[f]x,yGenerate anxbyygrid. Iffis given, the grid is folded, with an edge attaching each pair of opposing corner vertices. This will havex*yvertices and2*x*y-y-xedges if unfolded and2*x*y-y-x+2edges if folded.-G[f]x,yGenerate anxbyypartial grid. Iffis given, the grid is folded, with an edge attaching each pair of opposing corner vertices. This will havex*yvertices.-hnGenerate a hypercube of degreen. This will have2^nvertices andn*2^(n-1)edges.-knGenerate a complete graph onnvertices withn*(n-1)/2edges.-bx,yGenerate a completexbyybipartite graph. This will havex+yvertices andx*yedges.-pnGenerate a path onnvertices. This will haven-1edges.-snGenerate a star onnvertices. This will haven-1edges.-SnGenerate a Sierpinski graph of ordern. This will have3*(3^(n-1)-1)/2vertices and3^nedges.-tnGenerate a binary tree of heightn. This will have2^n-1vertices and2^n-2edges.-Tx,yGenerate anxbyytorus. This will havex*yvertices and2*x*yedges.-wnGenerate a path onnvertices. This will haven-1edges.-ooutfileIf specified, the generated graph is written into the fileoutfile.Otherwise, the graph is written to standard out.-dMake the generated graph directed.-?Print usage information.

gvgenexits 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.

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

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