|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.jgrapht.generate.LinearGraphGenerator<V,E>
public class LinearGraphGenerator<V,E>
Generates a linear graph of any size. For a directed graph, the edges are oriented from START_VERTEX to END_VERTEX.
Field Summary | |
---|---|
static java.lang.String |
END_VERTEX
Role for the last vertex generated. |
static java.lang.String |
START_VERTEX
Role for the first vertex generated. |
Constructor Summary | |
---|---|
LinearGraphGenerator(int size)
Construct a new LinearGraphGenerator. |
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 START_VERTEX
public static final java.lang.String END_VERTEX
Constructor Detail |
---|
public LinearGraphGenerator(int size)
size
- number of vertices to be generated
java.lang.IllegalArgumentException
- if the specified size is negative.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 |