Marc-Roig/Path_Finding

Path finding algorithms

Breadth first Search

A*

This is far from being optimized and well structured. If you are interested in learning how to implement this type of algorithms you might want to check this:

• All sort of data structures in java

• One of the best explanations I have seen on how to implement Breadth first search, Dijkstra’s Algorithm and A* from Red Blob Games

• A* in javascript by Daniel Shiffman

Priority queue explanations:

• William Fiset (Youtube)
• Priority Queue in javascript