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

Edge org::_3pq::jgrapht::traverse::ClosestFirstIterator::getSpanningTreeEdge ( Object  vertex  )  [inline]

Get the spanning tree edge reaching a vertex which has been seen already in this traversal. This edge is the last link in the shortest known path between the start vertex and the requested vertex. If the vertex has already been visited, then it is truly the minimum spanning tree edge; otherwise, it is the best candidate seen so far.

vertex the spanned vertex.
the spanning tree edge, or null if the vertex either has not been seen yet or is the start vertex.

Definition at line 156 of file ClosestFirstIterator.java.

References org::_3pq::jgrapht::traverse::CrossComponentIterator::getSeenData(), and org::_3pq::jgrapht::traverse::ClosestFirstIterator::QueueEntry::m_spanningTreeEdge.

        QueueEntry entry = (QueueEntry) getSeenData( vertex );

        if( entry == null ) {
            return null;

        return entry.m_spanningTreeEdge;

Generated by  Doxygen 1.6.0   Back to index