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 would also add, when you're performing the check if a shorter distance has been found (distance(u) + length(u,v)), ignore the check if the distance to your vertex (distance(u)) is the max value. Otherwise you might have an overflow error like I did.
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 →
I would also add, when you're performing the check if a shorter distance has been found (distance(u) + length(u,v)), ignore the check if the distance to your vertex (distance(u)) is the max value. Otherwise you might have an overflow error like I did.