Class CompleteBipartiteGraphGenerator<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Implemented Interfaces:

    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.
    Andrew Newell
    • Constructor Detail

      • CompleteBipartiteGraphGenerator

        public CompleteBipartiteGraphGenerator​(int partitionA,
                                               int partitionB)
        Creates a new CompleteBipartiteGraphGenerator object.
        partitionA - number of vertices in the first partition
        partitionB - number of vertices in the second partition
      • CompleteBipartiteGraphGenerator

        public CompleteBipartiteGraphGenerator​(Set<V> partitionA,
                                               Set<V> partitionB)
        Creates a new CompleteBipartiteGraphGenerator object. A complete bipartite graph is generated on the vertices provided between the vertices provided in the two partitions. Note that all vertices in both partitionA and partitionB must be present in the graph or an exception will be thrown during the invocation of generateGraph(Graph, Map)
        partitionA - first partition
        partitionB - second partition
    • Method Detail

      • generateGraph

        public void generateGraph​(Graph<V,​E> target,
                                  Map<String,​V> resultMap)
        Construct a complete bipartite graph
        Specified by:
        generateGraph in interface GraphGenerator<V,​E,​V>
        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
        resultMap - if non-null, receives implementation-specific mappings from String roles to graph elements (or collections of graph elements)