ShortestPath

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` 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
```
java.util.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.