org._3pq.jgrapht.alg
Class DijkstraShortestPath

java.lang.Object
  extended byorg._3pq.jgrapht.alg.DijkstraShortestPath

public final class DijkstraShortestPath
extends java.lang.Object

An implementation of Dijkstra's shortest path algorithm using ClosestFirstIterator.

Since:
Sep 2, 2003
Author:
John V. Sichi

Method Summary
static java.util.List findPathBetween(Graph graph, java.lang.Object startVertex, java.lang.Object endVertex)
          Find the shortest path between two vertices, represented as a List of Edges in order from start to end vertex.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Method Detail

findPathBetween

public static java.util.List findPathBetween(Graph graph,
                                             java.lang.Object startVertex,
                                             java.lang.Object endVertex)
Find the shortest path between two vertices, represented as a List of Edges in order from start to end vertex.

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