ShortestPath (JUNG (parent metadata project) 2.1.1 API)

All Known Implementing Classes:

DijkstraShortestPath, UnweightedShortestPath
```
public interface ShortestPath<V,E>
```
An interface for algorithms that calculate shortest paths.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`java.util.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
```
java.util.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