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.
the definition clearly says undirected, and a well defined graph can have at most 1 undirected edge between any 2 nodes, 2 if they are directed. something is fishy :)
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 →
the definition clearly says undirected, and a well defined graph can have at most 1 undirected edge between any 2 nodes, 2 if they are directed. something is fishy :)