📢 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 finds Minimum Spanning Tree in a

      weighted graph by adding edges in increasing order?
      A Prim’s Algorithm Correct Answer Incorrect Answer
      B Kruskal’s Algorithm Correct Answer Incorrect Answer
      C Dijkstra’s Algorithm Correct Answer Incorrect Answer
      D BFS Correct Answer Incorrect Answer
      E DFS Correct Answer Incorrect Answer

      Solution

      Kruskal’s algorithm sorts edges by weight and adds them without forming cycles to build the MST.

      Practice Next
      More Algorithms Questions
      ask-question