Class SimpleWeightedBipartiteGraphMatrixGenerator<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Implemented Interfaces:
    GraphGenerator<V,​E,​V>

    public class SimpleWeightedBipartiteGraphMatrixGenerator<V,​E>
    extends WeightedGraphGeneratorAdapter<V,​E,​V>
    A simple weighted bipartite graph matrix generator.
    • Field Detail

      • first

        java.util.List<V> first
      • second

        java.util.List<V> second
    • Constructor Detail

      • SimpleWeightedBipartiteGraphMatrixGenerator

        public SimpleWeightedBipartiteGraphMatrixGenerator()
    • Method Detail

      • generateGraph

        public void generateGraph​(WeightedGraph<V,​E> target,
                                  VertexFactory<V> vertexFactory,
                                  java.util.Map<java.lang.String,​V> resultMap)
        Generate a weighted graph structure. The topology of the generated graph is dependent on the implementation. For graphs in which not all vertices share the same automorphism equivalence class, the generator may produce a labeling indicating the roles played by generated elements. This is the purpose of the resultMap parameter. For example, a generator for a wheel graph would designate a hub vertex. Role names used as keys in resultMap should be declared as public static final Strings by implementation classes.
        Specified by:
        generateGraph in class WeightedGraphGeneratorAdapter<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)