Path planning using wavefront propagation

[DarkMortal]

The basic idea is to traverse all possible neighboring cells and calculating the minimum cost (represented by their d-value) and find the shortest path that can be used to traverse between the source and the destination This video can be used for reference Here's my implementation of this algorithm