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

  • google app store apple app store
  • ✖

      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

      Relevant for Exams:

      ask-question