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

Modifier and Type	Method and Description
Map<V,E>	getIncomingEdgeMap(V source) Returns a map from vertices to the last edge on the shortest path to that vertex starting from source.

Method Detail

getIncomingEdgeMap

Map<V,E> getIncomingEdgeMap(V source)

Returns a map from vertices to the last edge on the shortest path to that vertex starting from source.

Parameters:

source - the starting point for the shortest paths

Returns:

a map from vertices to the last edge on the shortest path to that vertex starting from source