GATE CSE 2004 Q ||Algorithms || GATE Insights Version: CSE
Planning to take coaching on https://unacademy.com/
here is a code for 10% off PLUS1BPK1
Telegram Notification Group link:-
https://t.me/joinchat/X5egW_cvdt9kMGY1
Telegram discussion Group link:-
https://t.me/joinchat/VCyGUmVq8RNkMzhl
Downloads resources from here
https://education4fun.com/gate-cse/
MCQ (Single Correct Answer)
GATE CSE 2004
Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge-weighted directed graph with vertex P as the source.In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?
A) P,Q,R,S,T,U
B) P,Q,R,U,S,T
C) P,Q,R,U,T,S
D) P,Q,T,R,U,S