extractShortestPathFromPredecessorList static method

List extractShortestPathFromPredecessorList(
  1. dynamic predecessors,
  2. dynamic end
)

Extract shortest path from predecessor list

Implementation

static List extractShortestPathFromPredecessorList(predecessors, end) {
  var nodes = [];
  var u = end;
  while (u != null) {
    nodes.add(u);
    u = predecessors[u];
  }
  if (nodes.length == 1) return [];
  return nodes.reversed.toList();
}