\manpage {} {graph\_gen} {Graph Generators} 
 
\func  void complete\_graph {(graph\&\ G, \ int\ n)}
           {  creates a complete graph $G$ with $n$ nodes.  }
 
 
\func  void random\_graph {(graph\&\ G, \ int\ n, \ int\ m)}
           {  creates a random graph $G$ with $n$ nodes and $m$ edges.  }
 
 
\func  void test\_graph {(graph\&\ G)}
           {  creates interactively a user defined graph $G$.  }
 
 
\func  void complete\_bigraph {(graph\&\ G, int\ a, int\ b, list\<node\>\&\ A, list\<node\>\&\ B)}
           {  creates a complete bipartite graph $G$ with $a$ nodes
            on side $A$ and $b$ nodes on side $B$. All edges are 
            directed from $A$ to $B$.  }
 
 
\func  void random\_bigraph {(graph\&\ G, int\ a, int\ b, int\ m, list\<node\>\&\ A, list\<node\>\&\ B)}
           {  creates a random bipartite graph $G$ with $a$ nodes on
            side $A$, $b$ nodes on side $B$, and $m$ edges. All 
            edges are directed from $A$ to $B$.  }
 
 
\func  void test\_bigraph {(graph\&\ G, list\<node\>\&\ A, list\<node\>\&\ B)}
           {  creates interactively a user defined bipartite
	    graph $G$ with sides $A$ and $B$. All edges are
	    directed from $A$ to $B$.  }
 
 
\func  void random\_planar\_graph {(graph\&\ G, \ int\ n)}
           {  creates a random planar graph $G$ with $n$ nodes.  }
 
 
\func  void random\_planar\_graph {(graph\&\ G, \ node\_array\<double\>\&\ xcoord, \ node\_array\<double\>\&\ ycoord, \ int\ n)}
           {  creates a random planar graph $G$ with $n$ nodes embedded into
            the unit sqare. The embedding is given by $xcoord[v]$ and
            $ycoord[v]$ for every node $v$ of $G$.  }
 
 
\func  void triangulated\_planar\_graph {(graph\&\ G, \ int\ n)}
           {  creates a triangulated planar graph $G$ with $n$ nodes.  }
 
 
\func  void triangulated\_planar\_graph {(graph\&\ G, \ node\_array\<double\>\&\ xcoord, \ node\_array\<double\>\&\ ycoord, \ int\ n)}
           {  creates a triangulated planar graph $G$ with $n$ nodes embedded
            into the unit sqare. The embedding is given by $xcoord[v]$ and
            $ycoord[v]$ for every node $v$ of $G$.  }
 
 
\func  void grid\_graph {(graph\&\ G, int\ n)}
           {  creates a grid graph $G$ of size $n\times n$ nodes.  }
 
 
\func  void grid\_graph {(graph\&, node\_array\<double\>\&\ xcoord, \ node\_array\<double\>\&\ ycoord, \ int\ n)}
           {  creates a grid graph $G$ of size $n\times n$ nodes embedded
            into the unit sqare. The embedding is given by $xcoord[v]$ and
            $ycoord[v]$ for every node $v$ of $G$.  }
 
 
\func  void cmdline\_graph {(graph\&\ G, \ int\ argc, \ char**\ argv)}
           {  builds graph $G$ as specified by the command line arguments:\\
prog \hbox to 1.5cm{\hfill}       $\longrightarrow$ test\_graph()\\
prog \hbox to 1.5cm{$n$\hfill}    $\longrightarrow$ complete\_graph($n$)\\
prog \hbox to 1.5cm{$n$ $m$\hfill}$\longrightarrow$ test\_graph($n,m$)\\
prog \hbox to 1.5cm{$file$\hfill} $\longrightarrow$ $G$.read\_graph($file$). 
 }
 
 
