edu.uci.ics.jung.algorithms.shortestpath
Class ShortestPath

java.lang.Object
  edu.uci.ics.jung.algorithms.shortestpath.ShortestPath

Direct Known Subclasses:

DijkstraShortestPath, UnweightedShortestPath

public abstract class ShortestPath

extends java.lang.Object

Author:

Joshua O'Madadhain

Constructor Summary

ShortestPath()

Method Summary

abstract java.util.Map	getIncomingEdgeMap(Vertex source) Returns a LinkedHashMap which maps each vertex in the graph (including the source vertex) to the last edge on the shortest path from the source vertex.
java.util.List	getPath(Vertex source, Vertex target) Returns a List of the edges on the shortest path from source to target, in order of their occurrence on this path.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ShortestPath

public ShortestPath()

Method Detail

getPath

public java.util.List getPath(Vertex source,
                              Vertex target)

Returns a List of the edges on the shortest path from source to target, in order of their occurrence on this path.

getIncomingEdgeMap

public abstract java.util.Map getIncomingEdgeMap(Vertex source)

Returns a LinkedHashMap which maps each vertex in the graph (including the source vertex) to the last edge on the shortest path from the source vertex.