Package org.jgrapht.alg
Class BidirectionalDijkstraShortestPath<V,E>
- java.lang.Object
-
- org.jgrapht.alg.BidirectionalDijkstraShortestPath<V,E>
-
- Type Parameters:
V
- the graph vertex typeE
- the graph edge type
@Deprecated public final class BidirectionalDijkstraShortestPath<V,E> extends java.lang.Object
Deprecated.in favor ofBidirectionalDijkstraShortestPath
A bidirectional version of Dijkstra's algorithm.See the Wikipedia article for details and references about bidirectional search. This technique does not change the worst-case behavior of the algorithm but reduces, in some cases, the number of visited vertices in practice. This implementation alternatively constructs forward and reverse paths from the source and target vertices respectively.
- Since:
- July 2016
- See Also:
DijkstraShortestPath
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description (package private) class
BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.The implementation details
-
Constructor Summary
Constructors Constructor Description BidirectionalDijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex)
Deprecated.Creates the instance and executes the bidirectional Dijkstra shortest path algorithm.BidirectionalDijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex, double radius)
Deprecated.Creates the instance and executes the bidirectional Dijkstra shortest path algorithm.
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Deprecated Methods Modifier and Type Method Description 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.GraphPath<V,E>
getPath()
Deprecated.Return the path found.java.util.List<E>
getPathEdgeList()
Deprecated.Return the edges making up the path.double
getPathLength()
Deprecated.Return the weighted length of the path found.
-
-
-
Constructor Detail
-
BidirectionalDijkstraShortestPath
public BidirectionalDijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex)
Deprecated.Creates the instance and executes the bidirectional Dijkstra shortest path algorithm. An instance is only good for a single search; after construction, it can be accessed to retrieve information about the found path.- Parameters:
graph
- the input graphstartVertex
- the vertex at which the path should startendVertex
- the vertex at which the path should end
-
BidirectionalDijkstraShortestPath
public BidirectionalDijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex, double radius)
Deprecated.Creates the instance and executes the bidirectional Dijkstra shortest path algorithm. An instance is only good for a single search; after construction, it can be accessed to retrieve information about the found path.- Parameters:
graph
- the input graphstartVertex
- the vertex at which the path should startendVertex
- the vertex at which the path should endradius
- 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.- 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 typeE
- the graph edge type- Parameters:
graph
- the graph to be searchedstartVertex
- the vertex at which the path should startendVertex
- the vertex at which the path should end- Returns:
- List of edges, or null if no path exists
-
-