shortestPath method
Returns the shortest path from the vertex start
to the vertex target
.
- Returns an empty list if
target
is not reachable fromstart
.
Implementation
List<T> shortestPath(T start, T target) => crawler.path(start, target);
Returns the shortest path from the vertex start
to the vertex target
.
target
is not reachable from start
.List<T> shortestPath(T start, T target) => crawler.path(start, target);