V - the graph vertex typeE - the graph edge typepublic class CompleteBipartiteGraphGenerator<V,E> extends Object implements GraphGenerator<V,E,V>
| Constructor and Description |
|---|
CompleteBipartiteGraphGenerator(int partitionOne,
int partitionTwo)
Creates a new CompleteBipartiteGraphGenerator object.
|
| Modifier and Type | Method and Description |
|---|---|
void |
generateGraph(Graph<V,E> target,
Map<String,V> resultMap)
Construct a complete bipartite graph
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgenerateGraphpublic CompleteBipartiteGraphGenerator(int partitionOne,
int partitionTwo)
partitionOne - number of vertices in the first partitionpartitionTwo - number of vertices in the second partitionpublic 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 non-empty on entry, the
result will be a disconnected graph since generated elements will not be connected to
existing elementsresultMap - if non-null, receives implementation-specific mappings from String roles to
graph elements (or collections of graph elements)Copyright © 2019. All rights reserved.