ЁЯУв Too many exams? DonтАЩt know which one suits you best? Book Your Free Expert ЁЯСЙ call Now!

    Question

    Which one of the following algorithm design techniques is

    used in finding all pairs of shortest distances in a graph?
    A Dynamic Programming Correct Answer Incorrect Answer
    B Backtracking Correct Answer Incorrect Answer
    C Greedy Correct Answer Incorrect Answer
    D None of these Correct Answer Incorrect Answer

    Solution

    Bellman-Ford algorithm┬аis used to find all pairs shortest distances in a graph and it is dynamic programming technique.

    Practice Next
    More IT Networking Questions

    Relevant for Exams:

    ask-question