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.
In this case, adjacency lists are the way to do it. If you look at the complexities -- adjacency matrices almost always hit worst case...not to mention a shitton of wasted space.
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 →
In this case, adjacency lists are the way to do it. If you look at the complexities -- adjacency matrices almost always hit worst case...not to mention a shitton of wasted space.