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
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 fromsource
.
-
-
-
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 fromsource
.- 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
-
-