Pathfinder

Welcome to my path finder exercise.

Breadth first search, depth first search, Dijkstra and A* are four useful path finding algorithms. Since breadth first and Dijkstra are identical when there's no terrain involved, only three are built here.

They work like this:

A*

Dijkstra

Depth first

The first two algorithms guarantee the shortest path possible. Depth first is less demanding on memory space.

Further reading

http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html

http://csis.pace.edu/~benjamin/teaching/cs627/webfiles/Astar.pdf

https://medium.com/@urna.hybesis/pathfinding-algorithms-the-four-pillars-1ebad85d4c6b

https://www.raywenderlich.com/3016-introduction-to-a-pathfinding

https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/lecture-videos/MIT6_006F11_lec14.pdf

Thanks for visiting.