Class ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<V,E>

Type Parameters:
V - vertices type
E - edges type
Enclosing class:
ContractionHierarchyBidirectionalDijkstra<V,E>

static class ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<V,E> extends BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,E>
Maintains search frontier during shortest path computation.
  • Field Details

    • isFinished

      boolean isFinished
  • Constructor Details

    • ContractionSearchFrontier

      ContractionSearchFrontier(Graph<V,E> graph, Supplier<org.jheaps.AddressableHeap<Double,Pair<V,E>>> heapSupplier)
      Constructs an instance of a search frontier for the given graph, heap supplier and isDownwardEdge function.
      Parameters:
      graph - the graph
      heapSupplier - supplier for the preferable heap implementation