shortestPaths method

Map<Vertex<T>, List<Vertex<T>>> shortestPaths(
  1. Vertex<T> start
)

Returns a Map of the shortest paths from start to each node in the directed graph defined by edges.

Implementation

Map<Vertex<T>, List<Vertex<T>>> shortestPaths(Vertex<T> start) {
  return graphs.shortestPaths<Vertex<T>>(start, edges);
}