org.thegalactic.dgraph

Class DAGraphFactory

java.lang.Object

org.thegalactic.dgraph.DAGraphFactory

public final class DAGraphFactory
extends Object

DAGraphFactory.

Method Summary

Modifier and Type	Method and Description
DAGraph<Integer,?>	divisors(int number) Generates the directed asyclic graph (DAG) of divisors for integers included betwwen 2 and the specified value.
static DAGraphFactory	getInstance() Return the singleton instance of this class.
DAGraph<Integer,?>	random(int size) Generates a random directed graph of size nodes.
DAGraph<Integer,?>	random(int size, double threshold) Generates a random directed and acyclic graph (DAG) of size nodes.

Methods inherited from class java.lang.Object

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

Method Detail

getInstance

public static DAGraphFactory getInstance()

Return the singleton instance of this class.

Returns:

the singleton instance

divisors

public DAGraph<Integer,?> divisors(int number)

Generates the directed asyclic graph (DAG) of divisors for integers included betwwen 2 and the specified value.

In this DAG, nodes corresponds to the integers, and there is an edge between two integers if and only if the second one is divisible by the first one.

Parameters:

number - the maximal integer

Returns:

the acyclic graph

random

public DAGraph<Integer,?> random(int size,
                                 double threshold)

Generates a random directed and acyclic graph (DAG) of size nodes.

Parameters:

size - the number of nodes of the generated graph

threshold - the threshold to generate an edge

Returns:

a random acyclic graph

random

public DAGraph<Integer,?> random(int size)

Generates a random directed graph of size nodes.

Parameters:

size - the number of nodes of the generated graph

Returns:

a random acyclic graph