V- the graph vertex type
E- the graph edge type
public 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|
Construct a new CompleteGraphGenerator.
|Modifier and Type||Method and Description|
Generate a graph structure.
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public CompleteGraphGenerator(int size)
size- number of vertices to be generated
IllegalArgumentException- if the specified size is negative
public void generateGraph(Graph<V,E> target, Map<String,V> resultMap)
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)
Copyright © 2019. All rights reserved.