Class BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>

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) final org.jheaps.AddressableHeap<Double, Pair<V,E>>	heap
(package private) final Map<V, org.jheaps.AddressableHeap.Handle<Double, Pair<V,E>>>	seen

Fields inherited from class BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier

graph

Constructor Summary

Constructors

Constructor	Description
DijkstraSearchFrontier(Graph<V,E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V,E>>> heapSupplier)

Method Summary

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 Object

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

Field Details

heap

final org.jheaps.AddressableHeap<Double, Pair<V,E>> heap

seen

final Map<V, org.jheaps.AddressableHeap.Handle<Double, Pair<V,E>>> seen

Constructor Details

DijkstraSearchFrontier

DijkstraSearchFrontier(Graph<V,E> graph,
 Supplier<org.jheaps.AddressableHeap<Double, Pair<V,E>>> heapSupplier)

Method Details

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