Interface GraphGenerator<V,​E,​T>

    • Method Detail

      • generateGraph

        void generateGraph​(Graph<V,​E> target,
                           java.util.Map<java.lang.String,​T> resultMap)
        Generate a 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.
        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
        resultMap - if non-null, receives implementation-specific mappings from String roles to graph elements (or collections of graph elements)
        Throws:
        java.lang.UnsupportedOperationException - if the graph does not have appropriate vertex and edge suppliers, in order to be able to create new vertices and edges. Methods Graph.getEdgeSupplier() and Graph.getVertexSupplier() must not return null.
      • generateGraph

        default void generateGraph​(Graph<V,​E> target)
        Generate a graph structure.
        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
        Throws:
        java.lang.UnsupportedOperationException - if the graph does not have appropriate vertex and edge suppliers, in order to be able to create new vertices and edges