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.
Nice! Even the queue grows to O(E), add to queue is still essentially O(logV). I guess the only concern is combining edges between same pairs of nodes, so E is bounded.
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 →
Nice! Even the queue grows to O(E), add to queue is still essentially O(logV). I guess the only concern is combining edges between same pairs of nodes, so E is bounded.