Compute all shortest paths using the A* search algorithm. Whereas aStar (non-deterministic-ally) returns a single shortest path, aStarBag returns all shortest paths (in a non-deterministic order).

Multiple equivalent nodes (determined by the AStarOptions.key() function) will never be included twice in the path.

The shortest paths starting from AStarOptions.start up to a node for which AStarOptions.success() returns true are computed and returned in an iterable along with the cost (which, by definition, is the same for each shortest path). If no paths are found, undefined is returned. Each path comprises both the start and an end node. Note that while every path shares the same start node, different paths may have different end nodes.