Version 5.0 The LEDA User Manual

void random bigraph(graph& G, int a, int b, int m, list& A,
list& B, int k = 1)
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.
If k > 1 then A and B are divided into k groups of
about equal size and the nodes in the i-th group of A
have their edges to nodes in the i − 1-th and i + 1-th
group in B. All indices are modulo k.
void test bigraph(graph& G, list& A, list& B)
void grid graph(graph& G, int n)
creates interactively a user defined bipartite graph G
with sides A and B. All edges are directed from A to
B.
creates a grid graph G with n × n nodes.
void
grid graph(graph& G, node array& xcoord,
node array& ycoord, int n)
creates a grid graph G of size n × n embedded into
the unit square. The embedding is given by xcoord[v]
and ycoord[v] for every node v of G.
void d3 grid graph(graph& G, int n)
void
void
creates a three-dimensional grid graph G with n×n×n
nodes.
d3 grid graph(graph& G, node array& xcoord,
node array& ycoord, node array& zcoord,
int n)
creates a three-dimensional grid graph G of size n ×
n×n embedded into the unit cube. The embedding is
given by xcoord[v], ycoord[v], and zcoord[v] for every
node v of G.
cmdline graph(graph& G, int argc, char ∗ ∗argv)
Planar graph: Combinatorial Constructions
builds graph G as specified by the command line arguments:
prog −→ test graph()
prog n −→ complete graph(n)
prog n m −→ test graph(n, m)
prog file −→ G.read graph(file)
A maximal planar map with n nodes, n ≥ 3, has 3n − 6 uedges. It is constructed
iteratively. For n = 1, the graph consists of a single isolated node, for n = 2, the graph
consists of two nodes and one uedge, for n = 3 the graph consists of three nodes and three