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.
Well, doesn't it depend on whether the graph is dense or sparse? If we are working with a tree, for instance, adjacency lists are certainly appropriate. But if we have a graph with |E| >> |V|, it makes sense to use an adjacency matrix.
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 →
Well, doesn't it depend on whether the graph is dense or sparse? If we are working with a tree, for instance, adjacency lists are certainly appropriate. But if we have a graph with |E| >> |V|, it makes sense to use an adjacency matrix.