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.
Same here, after reading your post, I tested and realized my reading time is 8.2s, and processing time is 0.6s! Just curious, if you use priority queue, how do you do "decrease-key" ? I thought we need to implement our own indexed-minheap?
Thank you!
Cookie support is required to access HackerRank
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 →
Same here, after reading your post, I tested and realized my reading time is 8.2s, and processing time is 0.6s! Just curious, if you use priority queue, how do you do "decrease-key" ? I thought we need to implement our own indexed-minheap? Thank you!