Q38

MCQ2 marks, −0.5

Let $G(V,E)$ be 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\left(|V|^2\right)$

(B)

$O\left(|E|+|V|\log |V|\right)$

(C)

$O\left(|V|\log|V|\right)$

(D)

$O\left(\left(|E|+|V|\right)\log|V|\right)$

Loading…