shortestPaths method
Returns the shortest paths.
Implementation
List<List<Node<T>>> shortestPaths() {
if (isEmpty) return [];
var sorted = sortedPathsByLength();
var min = sorted.first.length;
var idx = sorted.indexWhere((p) => p.length > min);
if (idx < 0) {
return sorted;
} else {
var shortest = sorted.sublist(0, idx);
return shortest;
}
}