Menu
Home / GATE 2017-2018 / GATE CSE :: Discussion

Discussion :: GATE CSE

  1. Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra's shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to v is discovered.

    2. A.
    SDT
    B.
    SBDT
    C.
    SACDT
    D.
    SACET

    View Answer

    Workspace

    View Answer

    Answer : Option D

    Explanation :

    -NA-

Write your comments here:

Be The First To Comment