grph.algo.topology

Class ClassicalGraphs

java.lang.Object

grph.algo.topology.ClassicalGraphs

public class ClassicalGraphs
extends java.lang.Object

The Class ClassicalGraphs contains methods for easily obtaining classical graphs (paths, cycles, cliques, Petersen graph...)

Method Summary

Modifier and Type	Method and Description
Grph	clique(int n)
static Grph	completeBipartiteGraph(int m, int n) Constructs the complete bipartite graph Km,n.
static Grph	completeGraph(int n) Constructs the complete graph (also known as clique) on n vertices, Kn.
static Grph	cycle(int n) Constructs the cycle graph on n vertices, Cn.
static Grph	grid(int i, int j)
static Grph	path(int n) Constructs the path graph on n vertices, Pn.
static Grph	PetersenGraph() Constructs the Petersen graph.
static Grph	randomBipartiteGraph(int m, int n, double p) Constructs a random bipartite graph.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

clique

public Grph clique(int n)

path

public static Grph path(int n)

Constructs the path graph on n vertices, P_n.

Parameters:

n - the number of vertices of the path

Returns:

the path graph on n vertices, or the null graph (the graph of order zero) if n is non-positive

cycle

public static Grph cycle(int n)

Constructs the cycle graph on n vertices, C_n.

Parameters:

n - the number of vertices of the cycle

Returns:

the cycle graph on n vertices, or the null graph (the graph of order zero) if n is non-positive

completeGraph

public static Grph completeGraph(int n)

Constructs the complete graph (also known as clique) on n vertices, K_n.

Parameters:

n - the number of vertices of the complete graph

Returns:

the complete graph on n vertices, or the null graph (the graph of order zero) if n is non-positive

completeBipartiteGraph

public static Grph completeBipartiteGraph(int m,
                                          int n)

Constructs the complete bipartite graph K_m,n.

Parameters:

m - the number of vertices in the left side

n - the number of vertices in the right side

Returns:

the complete bipartite graph on K_m,n, or the null graph (the graph of order zero) if m or n is negative

randomBipartiteGraph

public static Grph randomBipartiteGraph(int m,
                                        int n,
                                        double p)

Constructs a random bipartite graph. The probability of the existence of an edge is given by the parameter p

Parameters:

m - the number of vertices in the left side

n - the number of vertices in the right side

p - the probability for an edge to exist

Returns:

PetersenGraph

public static Grph PetersenGraph()

Constructs the Petersen graph.

Returns:

the Petersen graph.

grid

public static Grph grid(int i,
                        int j)