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

Discussion :: GATE CSE

  1. What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
    2. A.
    Θ(n2)
    B.
    Θ(n2log n)
    C.
    Θ(n3)
    D.
    Θ(n3log n)

    View Answer

    Workspace

    View Answer

    Answer : Option C

    Explanation :

    -NA-

Write your comments here:

Be The First To Comment