Pathfinding algorithm using BFS

A JS implementation of a pathfinding algorithm using BFS (Breadth-first search) and rendering with HTML Canvas.

Complete stack:

• HTML
• JS (ES6)
• Webpack

Implementation details

The position of each occupied position is stored in an object in the format below:

{
    '0,0': 'player',
    '1,1': 'tree',
    '10,10': 'tree',
    '11,7': 'tree',
}

Storing positions this way we obtain time complexity of O(1) for checking a position.

Clicking at any position of the canvas will invoke a breadth-first search algorithm from the start position to the new one outputting the shortest possible distance.

At every step the start position is updated making it possible to change the target at any time and preserving the path already traveled.

Live Demo

https://pathfinding-adriano.herokuapp.com/

Preview