V
 the graph vertex typeE
 the graph edge typepublic class CompleteGraphGenerator<V,E> extends Object implements GraphGenerator<V,E,V>
A complete graph is a graph where every vertex shares an edge with every other vertex. If it is a directed graph, then edges must always exist in both directions.
Constructor and Description 

CompleteGraphGenerator()
Construct a new CompleteGraphGenerator.

CompleteGraphGenerator(int size)
Construct a new CompleteGraphGenerator.

Modifier and Type  Method and Description 

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

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
generateGraph
public CompleteGraphGenerator(int size)
size
nodes to the target graph when invoking generateGraph(Graph, Map)
.
Next, a complete graph is generated on all nodes present in the target graph, including any nodes that were already present in the target graph.size
 number of vertices that will be added to the graphIllegalArgumentException
 if the specified size is negativepublic CompleteGraphGenerator()
generateGraph(Graph, Map)
public void generateGraph(Graph<V,E> target, Map<String,V> resultMap)
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 elementsresultMap
 if nonnull, receives implementationspecific mappings from String roles to
graph elements (or collections of graph elements)Copyright © 2019. All rights reserved.