| |
- addRandomEdges(G, nrAddEdges)
- Add nrAddEdges random edges to G.
- deleteRandomEdges(G, nrDelEdges)
- Delete nrDeleteEdges many edges from G if they do not connect leaves,
asserts at least n-1 + nrDelEdges edges in G.
- main_arbi(args)
- Print random, undirected, connected graphs to graphml-files.
- main_dense(args)
- Print random, undirected, connected, dense graphs to graphml-files.
- main_sparse(args)
- Print random, undirected, connected, sparse graphs to graphml-files.
- makeConnected(G)
- Add edges between components of G, delete same number of arbitrary edges.
- randomDenseGraph(n)
- Return an undirected dense graph.
Number of edges is a percentage p of the complete graph,
where p is normal distributed with $\mu = 0.85, \sigma = 0.035$.
- randomSpanningTree(G)
- Add a random spanning tree to G, by mimicking Kruskals algorithm.
- randomSparseGraph(n)
- Return an undirected sparse, but connected graph.
If n is large enough, number of edges is a percentage p of the complete graph,
where p is normal distributed with $\mu = 0.06, \sigma = 0.015$;
otherwise, at least a spanning tree exists.
|