To implement Dijkstra’s shortest path algorithm on unweighted graphs so that…

PYQ GATE 2006

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

  1. A.

    Queue

  2. B.

    Stack

  3. C.

    Heap

  4. D.

    B-Tree

Attempted by 853 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…