V
 graph vertex typeE
 graph edge typepublic class WindmillGraphsGenerator<V,E> extends Object implements GraphGenerator<V,E,V>
The windmill graph $W_n^{(m)}$ is the graph obtained by taking $m$ copies of the complete graph $K_n$ with a vertex in common. The Dutch windmill graph $D_n^{(m)}$, is the graph obtained by taking $m$ copies of the cycle graph $C_3$ with a vertex in common. For the special case where $n=3$, $D_n^{(m)}$ and $W_n^{(m)}$ are identical. The class of graphs $D_3^{(m)}$ is sometimes referred to as the Friendship graph, denoted by $F_m$.
Constructor and Description 

WindmillGraphsGenerator(org.jgrapht.generate.WindmillGraphsGenerator.Mode mode,
int m,
int n)
Constructs a GeneralizedPetersenGraphGenerator used to generate a Generalized Petersen graphs
$GP(n,k)$.

Modifier and Type  Method and Description 

void 
generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generate a graph structure.

public WindmillGraphsGenerator(org.jgrapht.generate.WindmillGraphsGenerator.Mode mode, int m, int n)
mode
 indicate whether the generator should generate Windmill graphs or Dutch Windmill
graphsm
 number of copies of $C_n$ (Dutch Windmill graph) or $K_n$ (Windmill graph)n
 size of $C_n$ (Dutch Windmill graph) or $K_n$ (Windmill graph). To generate
friendship graphs, set $n=3$ (the mode is irrelevant).public void generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
GraphGenerator
generateGraph
in interface GraphGenerator<V,E,V>
target
 receives the generated edges and vertices; if this is nonempty on entry, the
result will be a disconnected graph since generated elements will not be connected to
existing elementsvertexFactory
 called to produce new verticesresultMap
 if nonnull, receives implementationspecific mappings from String roles to
graph elements (or collections of graph elements)Copyright © 2017. All rights reserved.