Package org.jgrapht.alg

Class BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier

java.lang.Object

org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier

Enclosing class:

BidirectionalDijkstraShortestPath.AlgorithmDetails

class BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
extends java.lang.Object

Helper class to maintain the search frontier

Field Summary

Fields

Modifier and Type	Field	Description
(package private) Graph<V,E>	graph
(package private) FibonacciHeap<BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry>	heap
(package private) java.util.Map<V,FibonacciHeapNode<BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry>>	seen
(package private) BidirectionalDijkstraShortestPath.AlgorithmDetails.Specifics	specifics

Constructor Summary

Constructors

Constructor	Description
SearchFrontier(Graph<V,E> graph)

Method Summary

Modifier and Type	Method	Description
double	getDistance(V v)
E	getTreeEdge(V v)
void	updateDistance(V v, E e, double distance)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

graph

final Graph<V,E> graph

specifics

final BidirectionalDijkstraShortestPath.AlgorithmDetails.Specifics specifics

heap

final FibonacciHeap<BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry> heap

seen

final java.util.Map<V,FibonacciHeapNode<BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry>> seen

Constructor Detail

SearchFrontier

public SearchFrontier(Graph<V,E> graph)

Method Detail

updateDistance

public void updateDistance(V v,
                           E e,
                           double distance)

getDistance

public double getDistance(V v)

getTreeEdge

public E getTreeEdge(V v)