ADT for Dijkstra

What data structure should be used so that Dijkstra shortest path algorithm on unweighted graphs runs in linear time?

×

Problem Loading...

Note Loading...

Set Loading...