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.