@macil/pathfinding@1.1.1

Built and signed on GitHub Actions

Built and signed on GitHub Actions

Compute a shortest path using the A* search algorithm.

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).

Count the total number of possible paths to reach a destination. There must be no loops in the graph, or the function will overflow its stack.

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.

Locate vertices amongst disjoint sets.

Separate components of an undirected graph into disjoint sets.

Extract connected components from a graph.

Separate components of an undirected graph into disjoint sets.