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 think that's a way to do it. In this problem, the longest edge will never be used. (I didn't complete this problem yet, though. Take this with a grain of salt.)
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 think that's a way to do it. In this problem, the longest edge will never be used. (I didn't complete this problem yet, though. Take this with a grain of salt.)