Class DijkstraShortestPath<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type

    @Deprecated
    public final class DijkstraShortestPath<V,​E>
    extends java.lang.Object
    Deprecated.
    An implementation of Dijkstra's shortest path algorithm using ClosestFirstIterator.
    Since:
    Sep 2, 2003
    • Field Summary

      Fields 
      Modifier and Type Field Description
      private GraphPath<V,​E> path
      Deprecated.
       
    • Constructor Summary

      Constructors 
      Constructor Description
      DijkstraShortestPath​(Graph<V,​E> graph, V startVertex, V endVertex)
      Deprecated.
      Creates and executes a new DijkstraShortestPath algorithm instance.
      DijkstraShortestPath​(Graph<V,​E> graph, V startVertex, V endVertex, double radius)
      Deprecated.
      Creates and executes a new DijkstraShortestPath algorithm instance.
    • Constructor Detail

      • DijkstraShortestPath

        public DijkstraShortestPath​(Graph<V,​E> graph,
                                    V startVertex,
                                    V endVertex)
        Deprecated.
        Creates and executes a new DijkstraShortestPath algorithm instance. An instance is only good for a single search; after construction, it can be accessed to retrieve information about the path found.
        Parameters:
        graph - the graph to be searched
        startVertex - the vertex at which the path should start
        endVertex - the vertex at which the path should end
      • DijkstraShortestPath

        public DijkstraShortestPath​(Graph<V,​E> graph,
                                    V startVertex,
                                    V endVertex,
                                    double radius)
        Deprecated.
        Creates and executes a new DijkstraShortestPath algorithm instance. An instance is only good for a single search; after construction, it can be accessed to retrieve information about the path found.
        Parameters:
        graph - the graph to be searched
        startVertex - the vertex at which the path should start
        endVertex - the vertex at which the path should end
        radius - limit on weighted path length, or Double.POSITIVE_INFINITY for unbounded search
    • Method Detail

      • getPathEdgeList

        public java.util.List<E> getPathEdgeList()
        Deprecated.
        Return the edges making up the path found.
        Returns:
        List of Edges, or null if no path exists
      • getPath

        public GraphPath<V,​E> getPath()
        Deprecated.
        Return the path found.
        Returns:
        path representation, or null if no path exists
      • getPathLength

        public double getPathLength()
        Deprecated.
        Return the weighted length of the path found.
        Returns:
        path length, or Double.POSITIVE_INFINITY if no path exists
      • findPathBetween

        public static <V,​E> java.util.List<E> findPathBetween​(Graph<V,​E> graph,
                                                                    V startVertex,
                                                                    V endVertex)
        Deprecated.
        Convenience method to find the shortest path via a single static method call. If you need a more advanced search (e.g. limited by radius, or computation of the path length), use the constructor instead.
        Type Parameters:
        V - the graph vertex type
        E - the graph edge type
        Parameters:
        graph - the graph to be searched
        startVertex - the vertex at which the path should start
        endVertex - the vertex at which the path should end
        Returns:
        List of Edges, or null if no path exists