org.jgrapht.generate
Class CompleteBipartiteGraphGenerator<V,E>
java.lang.Object
org.jgrapht.generate.CompleteBipartiteGraphGenerator<V,E>
- All Implemented Interfaces:
- GraphGenerator<V,E,V>
public class CompleteBipartiteGraphGenerator<V,E>
- extends java.lang.Object
- implements GraphGenerator<V,E,V>
Generates a complete
bipartite graph of any size. This is a graph with two partitions; two
vertices will contain an edge if and only if they belong to different
partitions.
- Since:
- Dec 21, 2008
- Author:
- Andrew Newell
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
CompleteBipartiteGraphGenerator
public CompleteBipartiteGraphGenerator(int partitionOne,
int partitionTwo)
- Creates a new CompleteBipartiteGraphGenerator object.
- Parameters:
partitionOne
- This is the number of vertices in the first partitionpartitionTwo
- This is the number of vertices in the second parition
generateGraph
public void generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
java.util.Map<java.lang.String,V> resultMap)
- Construct a complete bipartite graph
- Specified by:
generateGraph
in interface GraphGenerator<V,E,V>
- Parameters:
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 elementsvertexFactory
- called to produce new verticesresultMap
- if non-null, receives implementation-specific mappings
from String roles to graph elements (or collections of graph elements)