|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg._3pq.jgrapht.alg.DijkstraShortestPath
An implementation of Dijkstra's
shortest path algorithm using ClosestFirstIterator
.
Constructor Summary | |
DijkstraShortestPath(Graph graph,
java.lang.Object startVertex,
java.lang.Object endVertex,
double radius)
Creates and executes a new DijkstraShortestPath algorithm instance. |
Method Summary | |
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. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
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 searchMethod Detail |
public 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
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |