org.jgrapht.experimental

Class PartiteRandomGraphGenerator<V,E>

java.lang.Object

org.jgrapht.experimental.PartiteRandomGraphGenerator<V,E>

All Implemented Interfaces:

GraphGenerator<V,E,java.lang.Object[]>

public class PartiteRandomGraphGenerator<V,E>
extends java.lang.Object
implements GraphGenerator<V,E,java.lang.Object[]>

PartiteRandomGraphGenerator generates a partite uniform random graph of any size. A partite uniform random graph contains edges chosen independently uniformly at random from the set of possible edges between partition classes.

Since:

Sep 13, 2004

Constructor Summary

Constructors

Constructor and Description
PartiteRandomGraphGenerator(int[] numVertices, int numEdges) Construct a new PartiteRandomGraphGenerator for a k-partite graph.
PartiteRandomGraphGenerator(int numVertices1, int numVertices2, int numEdges) Construct a new PartiteRandomGraphGenerator for a bipartite graph.

Method Summary

Modifier and Type	Method and Description
void	generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,java.lang.Object[]> resultMap) TODO hb 30-nov-05: document me

Methods inherited from class java.lang.Object

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

Constructor Detail

PartiteRandomGraphGenerator

public PartiteRandomGraphGenerator(int numVertices1,
                                   int numVertices2,
                                   int numEdges)

Construct a new PartiteRandomGraphGenerator for a bipartite graph.

Parameters:

numVertices1 - number of vertices in the first partition

numVertices2 - number of vertices in the second partition

numEdges - number of edges to be generated

PartiteRandomGraphGenerator

public PartiteRandomGraphGenerator(int[] numVertices,
                                   int numEdges)

Construct a new PartiteRandomGraphGenerator for a k-partite graph.

Parameters:

numVertices - number of vertices in the k partitions

numEdges - number of edges to be generated between any two partitions

Method Detail

generateGraph

public void generateGraph(Graph<V,E> target,
                          VertexFactory<V> vertexFactory,
                          java.util.Map<java.lang.String,java.lang.Object[]> resultMap)

TODO hb 30-nov-05: document me

Specified by:

generateGraph in interface GraphGenerator<V,E,java.lang.Object[]>

Parameters:

resultMap - some array of vertices

target - receives the generated edges and vertices; if this is non-empty on entry, the result will be a disconnected graph since generated elements will not be connected to existing elements

vertexFactory - called to produce new vertices

See Also:

GraphGenerator.generateGraph(org.jgrapht.Graph<V, E>, org.jgrapht.VertexFactory<V>, java.util.Map<java.lang.String, T>)