Ans (C) is also possible in this case.. so, what is the answer ? confused about it.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+18 votes

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?

- $P,Q,R,S,T,U$
- $P,Q,R,U,S,T$
- $P,Q,R,U,T,S$
- $P,Q,T,R,U,S$

+18 votes

Best answer

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.2k
- Algorithms 3.6k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.3k
- CO & Architecture 2.9k
- Computer Networks 3.3k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 480
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 15

40,748 questions

47,470 answers

145,580 comments

62,234 users