We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I tried just using PriorityQueue for this problem and tested for test7 on my own machine. Surprisingly, the running time is pretty much the same as using self-implemented hash-indexed heap..In big O analysis, the time complexity is supposed to be degrading from O(ElogV) to O(EV), but I guess the decrease-key is not called as frequent as I thought, especially I checked if it is indeed relaxed before deleting and adding.
Thanks for the knowledge, this makes my life so much easier. :)
Dijkstra: Shortest Reach 2
You are viewing a single comment's thread. Return to all comments →
I tried just using PriorityQueue for this problem and tested for test7 on my own machine. Surprisingly, the running time is pretty much the same as using self-implemented hash-indexed heap..In big O analysis, the time complexity is supposed to be degrading from O(ElogV) to O(EV), but I guess the decrease-key is not called as frequent as I thought, especially I checked if it is indeed relaxed before deleting and adding. Thanks for the knowledge, this makes my life so much easier. :)