Version 5.0 The LEDA User Manual

11.22 Graph Generators ( graph gen )
void complete graph(graph& G, int n)
void complete ugraph(graph& G, int n)
creates a complete graph G with n nodes.
creates a complete undirected graph G with n nodes.
void random graph noncompact(graph& G, int n, int m)
generates a random graph with n nodes and m edges.
No attempt is made to store all edges in the same
adjacency list consecutively. This function is only included
for pedagogical reasons.
void
random graph(graph& G, int n, int m, bool no anti parallel edges,
bool loopfree, bool no parallel edges)
generates a random graph with n nodes and m edges.
All edges in the same adjacency list are stored consecutively.
If no parallel edges is true then no parallel edges are
generated, if loopfree is true then no self loops are
generated, and if no anti parallel edges is true then
no anti parallel edges are generated.
void random graph(graph& G, int n, int m)
void random simple graph(graph& G, int n, int m)
same as random graph(G, n, m, false, false, false).
same as random graph(G, n, m, false, false, true).
void random simple loopfree graph(graph& G, int n, int m)
same as random graph(G, n, m, false, true, true).
void random simple undirected graph(graph& G, int n, int m)
void random graph(graph& G, int n, double p)
void test graph(graph& G)
same as random graph(G, n, m, true, true, true).
generates a random graph with n nodes. Each edge
of the complete graph with n nodes is included with
probability p .
creates interactively a user defined graph G.
void complete bigraph(graph& G, int a, int b, list& A, list& 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.