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

All Methods Instance Methods Concrete Methods
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

final BidirectionalDijkstraShortestPath.Specifics specifics

final FibonacciHeap<BidirectionalDijkstraShortestPath.QueueEntry> heap

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

public SearchFrontier(Graph<V,E> graph)

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

Class BidirectionalDijkstraShortestPath.SearchFrontier