edu.uci.ics.jung.algorithms.shortestpath
Interface ShortestPath<V,E>

All Known Implementing Classes:

DijkstraShortestPath, UnweightedShortestPath

public interface ShortestPath<V,E>

An interface for algorithms that calculate shortest paths.

Method Summary

Map<V,E>

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

Method Detail

getIncomingEdgeMap

Map<V,E> getIncomingEdgeMap(V source)

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