Let G(V, E) an undirected graph with positive edge weights. Dijkstra's…
GATE · 2005 · CS
Let G(V, E) an undirected graph with positive edge weights. Dijkstra's single-source shortest path algorithm can be implemented using the binary heap data structure with time complexity:
- A.
O(| V |2)
- B.
O (| E | + | V | log | V |)
- C.
O (| V | log | V |)
- D.
O ((| E | + | V |) log | V |)
Attempted by 518 students.
Sign up free to check your answer
Sign up freeLoading lesson…