Class DijkstraShortestPath<V,​E>

    • Field Detail

      • radius

        private final double radius
      • heapSupplier

        private final java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,​Pair<V,​E>>> heapSupplier
    • Constructor Detail

      • DijkstraShortestPath

        public DijkstraShortestPath​(Graph<V,​E> graph)
        Constructs a new instance of the algorithm for a given graph. The constructed algorithm will use pairing heap as a default heap implementation.
        Parameters:
        graph - the graph
      • DijkstraShortestPath

        public DijkstraShortestPath​(Graph<V,​E> graph,
                                    double radius)
        Constructs a new instance of the algorithm for a given graph. The constructed algorithm will use pairing heap as a default heap implementation.
        Parameters:
        graph - the graph
        radius - limit on path length, or Double.POSITIVE_INFINITY for unbounded search
      • DijkstraShortestPath

        public DijkstraShortestPath​(Graph<V,​E> graph,
                                    java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,​Pair<V,​E>>> heapSupplier)
        Constructs a new instance of the algorithm for a given graph. The constructed algorithm will use the heap supplied by the heapSupplier
        Parameters:
        graph - the graph
        heapSupplier - supplier of the preferable heap implementation
      • DijkstraShortestPath

        public DijkstraShortestPath​(Graph<V,​E> graph,
                                    double radius,
                                    java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,​Pair<V,​E>>> heapSupplier)
        Constructs a new instance of the algorithm for a given graph.
        Parameters:
        graph - the graph
        radius - limit on path length, or Double.POSITIVE_INFINITY for unbounded search
        heapSupplier - supplier of the preferable heap implementation
    • Method Detail

      • findPathBetween

        public static <V,​E> GraphPath<V,​E> findPathBetween​(Graph<V,​E> graph,
                                                                       V source,
                                                                       V sink)
        Find a path between two vertices. For a more advanced search (e.g. limited by radius or using another heap), use the constructor instead.
        Type Parameters:
        V - the graph vertex type
        E - the graph edge type
        Parameters:
        graph - the graph to be searched
        source - the vertex at which the path should start
        sink - the vertex at which the path should end
        Returns:
        a shortest path, or null if no path exists
      • getPath

        public GraphPath<V,​E> getPath​(V source,
                                            V sink)
        Get a shortest path from a source vertex to a sink vertex.
        Parameters:
        source - the source vertex
        sink - the target vertex
        Returns:
        a shortest path or null if no path exists