Q45

MCQ2 marks, −0.5

Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to

(A)

only vertex $a$

(B)

only vertices $a, e, f, g, h$

(C)

only vertices $a, b, c, d$

(D)

all the vertices

Loading…