V
- the graph vertex typeE
- the graph edge typepublic class SimpleWeightedBipartiteGraphMatrixGenerator<V,E> extends Object implements GraphGenerator<V,E,V>
Modifier and Type | Field and Description |
---|---|
protected List<V> |
first |
protected List<V> |
second |
protected double[][] |
weights |
Constructor and Description |
---|
SimpleWeightedBipartiteGraphMatrixGenerator() |
Modifier and Type | Method and Description |
---|---|
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
first(List<? extends V> first)
Set the first partition of the generator.
|
void |
generateGraph(Graph<V,E> target,
Map<String,V> resultMap)
Generate a graph structure.
|
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
second(List<? extends V> second)
Set the second partition of the generator.
|
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> |
weights(double[][] weights)
Set the weights of the generator.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
generateGraph
public SimpleWeightedBipartiteGraphMatrixGenerator()
public SimpleWeightedBipartiteGraphMatrixGenerator<V,E> first(List<? extends V> first)
first
- the first partitionpublic SimpleWeightedBipartiteGraphMatrixGenerator<V,E> second(List<? extends V> second)
second
- the second partitionpublic SimpleWeightedBipartiteGraphMatrixGenerator<V,E> weights(double[][] weights)
weights
- the weightspublic 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 © 2018. All rights reserved.