Build a path leading to a target according to a parents map, which must contain no loop. This function can be used after dijkstraAll or dijkstraPartial to build a path from a starting point to a reachable target.

Compute a shortest path using the Dijkstra search algorithm.

Determine all reachable nodes from a starting point as well as the minimum cost to reach them and a possible optimal parent node using the Dijkstra search algorithm.

Determine some reachable nodes from a starting point as well as the minimum cost to reach them and a possible optimal parent node using the Dijkstra search algorithm.