|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg._3pq.jgrapht.generate.EmptyGraphGenerator
Generates an empty graph of any size. An empty graph is a graph that has no edges.
Constructor Summary | |
EmptyGraphGenerator(int size)
Construct a new EmptyGraphGenerator. |
Method Summary | |
void |
generateGraph(Graph target,
VertexFactory vertexFactory,
java.util.Map resultMap)
Generate a graph structure. The topology of the generated graph is dependent on the implementation. For graphs in which not all vertices share the same automorphism equivalence class, the generator may produce a labeling indicating the roles played by generated elements. This is the purpose of the resultMap parameter. For example, a generator for a wheel graph would designate a hub vertex. Role names used as keys in resultMap should be declared as public static final Strings by implementation classes. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public EmptyGraphGenerator(int size)
size
- number of vertices to be generated
java.lang.IllegalArgumentException
- if the specified size is negative.Method Detail |
public void generateGraph(Graph target, VertexFactory vertexFactory, java.util.Map resultMap)
generateGraph
in interface GraphGenerator
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 |