Pathfinding on a Grid

Draw walls and mud, drag the start and the goal, and watch how each algorithm searches.

Draw:

Visited cells
–
Path length (steps)
–
Path cost
–

Minimum spanning tree (Kruskal)

Connect every node with the least total weight.

The edges in the order Kruskal looks at them, lightest first: