📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    The Bellman-Ford algorithm executes relaxation steps how

    many times for a graph with V vertices?
    A V Correct Answer Incorrect Answer
    B V–1 Correct Answer Incorrect Answer
    C E Correct Answer Incorrect Answer
    D log V Correct Answer Incorrect Answer
    E Until convergence only Correct Answer Incorrect Answer

    Solution

    Bellman-Ford relaxes all edges (V–1) times to ensure shortest paths accounting for up to V–1 edges.

    Practice Next
    ask-question