BidirectionalDijkstraShortestPath.DijkstraSearchFrontier

java.lang.Object
- org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
- - org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>

Type Parameters:

V - vertices type

E - edges type

Direct Known Subclasses:

ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier

Enclosing class:

BidirectionalDijkstraShortestPath<V,E>
```
static class BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>
extends BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
```
Maintains search frontier during shortest path computation.

Field Summary

Fields
Modifier and Type	Field	Description
`(package private) org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>`	`heap`
`(package private) java.util.Map<V,org.jheaps.AddressableHeap.Handle<java.lang.Double,Pair<V,E>>>`	`seen`

Fields inherited from class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
graph

Constructor Summary

Constructors
Constructor	Description
`DijkstraSearchFrontier(Graph<V,E> graph, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`double`	`getDistance(V v)`	Returns distance to vertex `v` computed so far.
`E`	`getTreeEdge(V v)`	Returns edge which connects `v` to its predecessor in the shortest paths tree of this frontier.
`(package private) 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
  - heap
```
final org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>> heap
```
  - seen
```
final java.util.Map<V,org.jheaps.AddressableHeap.Handle<java.lang.Double,Pair<V,E>>> seen
```
- Constructor Detail
  - DijkstraSearchFrontier
```
DijkstraSearchFrontier(Graph<V,E> graph,
                       java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)
```
- Method Detail
  - updateDistance
```
void updateDistance(V v,
                    E e,
                    double distance)
```
  - getDistance
```
public double getDistance(V v)
```
    Description copied from class: BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
    
    Returns distance to vertex v computed so far.
    
    Specified by:
    
    getDistance in class BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
    
    Parameters:
    
    v - vertex
    
    Returns:
    
    distance to v
  - getTreeEdge
```
public E getTreeEdge(V v)
```
    Description copied from class: BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
    
    Returns edge which connects v to its predecessor in the shortest paths tree of this frontier.
    
    Specified by:
    
    getTreeEdge in class BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
    
    Parameters:
    
    v - vertex
    
    Returns:
    
    edge in shortest paths tree