To implement Dijkstra's shortest path algorithm on un weighted graphs so that it runs in linear time, the data structure to be used is:

Keep practicing — related questions

• The data structures needed to implement Dijkstra's algorithm are
• Let G (V,E) an undirected graph with positive edge weights. Dijkstra's single source-shortes path algorithm...
• Dijkstra's algorithm is an example of which of the following data structures?
• In an unweighted, undirected connected graph, the shortest path from a node S to every other node is comput...
• In an unweighted, undirected connected graph, the shortest path from a node S to every other node is comput...
• Which of the following data structures is used by the Breadth First Search algorithm to store intermediate ...
• Which of the following functions is used for expressing the upper bound of the running time of an algorithm?
• Decimal to binary conversion can be implemented using which of the following data structures?