In this project, I tried to reproduce the result from Daniel's project which he posted on his youtube channel. This project will visualize the A star algorithm for a pathfinding application. As I know, this algorithm has been developed to many different versions and is used widely in game industry.
The programming language for this project is Javascript and I'm also using an external library called p5js.
Big O analysis
Worst case time performance:
O(|E|) = O(b^{d})
Worst case space complexity:
O(|V|) = O(b^{d})
Where
V : number of vertices of the graph
E : number of edges of the graph
d : the depth of the solution (the shortest path)
b : the branching factor
About Author

I’m Viet, the founder of this website with 8+ years experience in data analytics. My sharing is focus on data, which specialise on both Analytics and Business Intelligence platform as well as Data Science and Machine Learning platform.