ЁЯУв 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 algorithm is best suited to find the shortest path

      in a graph with negative edge weights but no negative cycles?
      A DijkstraтАЩs Algorithm Correct Answer Incorrect Answer
      B KruskalтАЩs Algorithm Correct Answer Incorrect Answer
      C Bellman-Ford Algorithm Correct Answer Incorrect Answer
      D Floyd-Warshall Algorithm Correct Answer Incorrect Answer
      E Topological Sort Correct Answer Incorrect Answer

      Solution

      Bellman-Ford handles negative edge weights safely, unlike DijkstraтАЩs algorithm.

      Practice Next
      More Algorithms Questions
      ask-question