Class WheelGraphGenerator<V,​E>

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

    public class WheelGraphGenerator<V,​E>
    extends Object
    implements GraphGenerator<V,​E,​V>
    Generates a wheel graph of any size. Reminding a bicycle wheel, a wheel graph has a hub vertex in the center and a rim of vertices around it that are connected to each other (as a ring). The rim vertices are also connected to the hub with edges that are called "spokes".
    John V. Sichi
    • Constructor Detail

      • WheelGraphGenerator

        public WheelGraphGenerator​(int size)
        Creates a new WheelGraphGenerator object. This constructor is more suitable for undirected graphs, where spokes' direction is meaningless. In the directed case, spokes will be oriented from rim to hub.
        size - number of vertices to be generated.
      • WheelGraphGenerator

        public WheelGraphGenerator​(int size,
                                   boolean inwardSpokes)
        Construct a new WheelGraphGenerator.
        size - number of vertices to be generated.
        inwardSpokes - if true and graph is directed, spokes are oriented from rim to hub; else from hub to rim.
        IllegalArgumentException - in case the number of vertices is negative
    • Method Detail

      • generateGraph

        public void generateGraph​(Graph<V,​E> target,
                                  Map<String,​V> 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.
        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)