Logo Search packages:      
Sourcecode: libjgrapht-java version File versions  Download package

void org::_3pq::jgrapht::generate::RingGraphGenerator::generateGraph ( Graph  target,
VertexFactory  vertexFactory,
Map  resultMap 
) [inline]

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.

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 elements
vertexFactory called to produce new vertices
resultMap if non-null, receives implementation-specific mappings from String roles to graph elements (or collections of graph elements)

Implements org::_3pq::jgrapht::generate::GraphGenerator.

Definition at line 78 of file RingGraphGenerator.java.

References org::_3pq::jgrapht::Graph::addEdge(), and org::_3pq::jgrapht::generate::LinearGraphGenerator::generateGraph().

Referenced by org::_3pq::jgrapht::generate::WheelGraphGenerator::generateGraph().

        if( m_size < 1 ) {

        LinearGraphGenerator linearGenerator =
            new LinearGraphGenerator( m_size );
        Map                  privateMap = new HashMap(  );
        linearGenerator.generateGraph( target, vertexFactory, privateMap );

        Object startVertex =
            privateMap.get( LinearGraphGenerator.START_VERTEX );
        Object endVertex = privateMap.get( LinearGraphGenerator.END_VERTEX );
        target.addEdge( endVertex, startVertex );

Generated by  Doxygen 1.6.0   Back to index