-
Returns a complete binary tree graph on V
vertices.
GraphGenerator.bipartite(int V1,
int V2,
double p)
Returns a random simple bipartite graph on V1
and V2
vertices,
containing each possible edge with probability p
.
GraphGenerator.connected(int V,
int E,
int c)
GraphGenerator.cycle(int V)
Returns a cycle graph on V
vertices.
Returns an Eulerian cycle graph on V
vertices.
Returns an Eulerian path graph on V
vertices.
Create a graph from input stream.
GraphGenerator.path(int V)
Returns a path graph on V
vertices.
GraphGenerator.random(int V,
int E)
GraphGenerator.regular(int V,
int k)
Returns a uniformly random k
-regular graph on V
vertices
(not necessarily simple).
GraphGenerator.simple(int V,
int E)
GraphGenerator.star(int V)
Returns a star graph on V
vertices.
GraphGenerator.tree(int V)
Returns a uniformly random tree on V
vertices.
GraphGenerator.wheel(int V)
Returns a wheel graph on V
vertices.
static int
private void
private void
private boolean
private boolean
private boolean
private boolean
static int
private void
private void
private void
private void
private void
private void
private void
private void
private void
private boolean
private boolean
private boolean
private boolean
static int
private static int
private static int
static int
static void
private static boolean
The code below is solely for testing correctness of the data type.
private static boolean
The code below is solely for testing correctness of the data type.
static void
private boolean
private static void
private static void
Computes an Eulerian cycle in the specified graph, if one exists.
Computes an Eulerian path in the specified graph, if one exists.