Class BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,​E>

    • 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