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?
Answer is (B). In Dijkstra's algorithm at each point we choose the smallest weight edge which starts from any one of the vertices in the shortest path found so far and add it to the shortest path.
Answer will be "B"
When will be the final official key...