|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.jgrapht.generate.WheelGraphGenerator<V,E>
public class WheelGraphGenerator<V,E>
Generates a wheel graph of any size. Reminding a bicycle wheel, a wheel graph has a hub vertex in the center and a rim of vertices around it that are connected to each other (as a ring). The rim vertices are also connected to the hub with edges that are called "spokes".
Field Summary | |
---|---|
static java.lang.String |
HUB_VERTEX
Role for the hub vertex. |
Constructor Summary | |
---|---|
WheelGraphGenerator(int size)
Creates a new WheelGraphGenerator object. |
|
WheelGraphGenerator(int size,
boolean inwardSpokes)
Construct a new WheelGraphGenerator. |
Method Summary | |
---|---|
void |
generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
java.util.Map<java.lang.String,V> resultMap)
Generate a graph structure. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public static final java.lang.String HUB_VERTEX
Constructor Detail |
---|
public WheelGraphGenerator(int size)
size
- number of vertices to be generated.public WheelGraphGenerator(int size, boolean inwardSpokes)
size
- number of vertices to be generated.inwardSpokes
- if true
and graph is directed, spokes
are oriented from rim to hub; else from hub to rim.
java.lang.IllegalArgumentException
Method Detail |
---|
public void generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.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 elementsvertexFactory
- called to produce new verticesresultMap
- if non-null, receives implementation-specific mappings
from String roles to graph elements (or collections of graph elements)
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |