1 package net
.kezvh
.algorithms
.graph
;
7 public interface SingleSourceShortestPath
<T
> {
10 * @return shortest path between the two points
12 Path
<T
> getShortestPath(T dest
);
16 * @return true if the source is connected to the destination;
18 boolean connected(T dest
);
21 * @return the source for this sssp instance