While job searching me and a mate made an interactive app to learn ReactJS and teach graphing algorithms (Dijkstra, A*, BFS etc). Enjoy it (and contact us if you have any exciting jr. dev roles/opportunities !)
contact us if you have any exciting
jr. dev roles/opportunities
Under "Depth First Search" you say:
> Depth first search is the only algorithm listed which will NOT find the shortest path.
That turns out not to be the case. Euclidean will also sometimes not find the shortest path. And indeed, you say so in the section on Euclidean you say:
> *However because our grid is only traversable on horizontal or vertical vertices using this heurtistic will NOT always give the shortest path, ..."
You also mis-spelled "heuristics", but that's easily done, and easily fixed.
The app is nice ... well done.