shortestPaths method
Returns a map containing the shortest paths from
start
to each reachable vertex.
The map keys represent the set of vertices reachable from start
.
Implementation
Map<T, Iterable<T>> shortestPaths(T start) => crawler.shortestPaths(start);