|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg._3pq.jgrapht.generate.RingGraphGenerator
RingGraphGenerator generates a ring graph of any size. A ring graph is a graph that contains a single cycle that passes through all its vertices exactly once. For a directed graph, the generated edges are oriented consistently around the ring.
| Constructor Summary | |
RingGraphGenerator(int size)
Construct a new RingGraphGenerator. |
|
| Method Summary | |
void |
generateGraph(Graph target,
VertexFactory vertexFactory,
java.util.Map resultMap)
Generate a graph structure. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public RingGraphGenerator(int size)
size - number of vertices to be generated| Method Detail |
public void generateGraph(Graph target,
VertexFactory vertexFactory,
java.util.Map resultMap)
GraphGenerator
generateGraph in interface GraphGeneratortarget - 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)GraphGenerator.generateGraph(org._3pq.jgrapht.Graph, org._3pq.jgrapht.VertexFactory, java.util.Map)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||