You are viewing a single comment's thread. Return to all comments →
Thanks a lot for replying! Did you use pq.remove() before re-adding? I read on this post that its time complexity is O(N) instead of O(logN)? http://stackoverflow.com/questions/12719066/priority-queue-remove-complexity-time
Seems like cookies are disabled on this browser, please enable them to open this website
Dijkstra: Shortest Reach 2
You are viewing a single comment's thread. Return to all comments →
Thanks a lot for replying! Did you use pq.remove() before re-adding? I read on this post that its time complexity is O(N) instead of O(logN)? http://stackoverflow.com/questions/12719066/priority-queue-remove-complexity-time