I think your priority queue is doing O(nlogn) sort for every insert https://github.com/npretto/pathfinding/blob/master/src/algo/...
This should be a heap with O(logn) insert instead to be truly Dijsktra/A*
Show HN: BFS, Dijkstra and A* interactive demo made in React
21–23 of 23 posts
Re: Show HN: BFS, Dijkstra and A* interactive demo made in React
#22I think your priority queue is doing O(nlogn) sort for every insert https://github.com/npretto/pathfinding/blob/master/src/algo/... This should be a heap with O(logn) insert instead to be truly Dijsktra/A*
Dijkstra / A* search algorithm do not prescribe which algorithm to use to add/insert items to the queue, or which algorithm to use to maintain a priority queue. So, your optimization might be an improvement, but it doesn't make the process "more or less" truly Dijkstra or A*.
Re: Show HN: BFS, Dijkstra and A* interactive demo made in React
#23Thanks for posting this! Your repo is a fantastic bit of reading for people who are curious how to make a non-standard visualization with React JS.