Package 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 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

  • Constructor Details

    • CompleteBipartiteGraphGenerator

      public CompleteBipartiteGraphGenerator(int partitionOne, int partitionTwo)
      Creates a new CompleteBipartiteGraphGenerator object.
      Parameters:
      partitionOne - This is the number of vertices in the first partition
      partitionTwo - This is the number of vertices in the second parition

  • Method Details

    • generateGraph

      public void generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<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 elements
      vertexFactory - called to produce new vertices
      resultMap - if non-null, receives implementation-specific mappings from String roles to graph elements (or collections of graph elements)