org._3pq.jgrapht.alg
public final class DijkstraShortestPath extends java.lang.Object
ClosestFirstIterator
.Constructor and Description |
---|
DijkstraShortestPath(Graph graph,
java.lang.Object startVertex,
java.lang.Object endVertex,
double radius)
Creates and executes a new DijkstraShortestPath algorithm instance.
|
Modifier and Type | Method and Description |
---|---|
static java.util.List |
findPathBetween(Graph graph,
java.lang.Object startVertex,
java.lang.Object endVertex)
Convenience method to find the shortest path via a single static method
call.
|
java.util.List |
getPathEdgeList()
Return the edges making up the path found.
|
double |
getPathLength()
Return the length of the path found.
|
public DijkstraShortestPath(Graph graph, java.lang.Object startVertex, java.lang.Object endVertex, double radius)
graph
- the graph to be searchedstartVertex
- the vertex at which the path should startendVertex
- the vertex at which the path should endradius
- limit on path length, or Double.POSITIVE_INFINITY for
unbounded searchpublic java.util.List getPathEdgeList()
public double getPathLength()
public static java.util.List findPathBetween(Graph graph, java.lang.Object startVertex, java.lang.Object endVertex)
graph
- the graph to be searchedstartVertex
- the vertex at which the path should startendVertex
- the vertex at which the path should end