shortestPath method

List<T> shortestPath(
  1. T start,
  2. T target
)
inherited

Returns the shortest path from the vertex start to the vertex target.

  • Returns an empty list if target is not reachable from start.

Implementation

List<T> shortestPath(T start, T target) => crawler.path(start, target);