Dijkstra's Pathfinding Algorithm in Action: Click on grid to add/remove obstacles. Red node is start, green node is end. Move start node with arrow keys, move green node with WASD. Press 1, 2, 3 to set to Manhattan, Euclidean, and Chebyshev heuristics. Space to start search.
Another pathfinding algorithm. https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm https://www.youtube.com/watch?v=pVfj6mxhdMw
