πŸ“’ Too many exams? Don’t know which one suits you best? Book Your Free Expert πŸ‘‰ call Now!

  • google app store apple app store
  • βœ–

      Question

      Consider a graph with vertices A, B, C, D and edges with

      weights: (A,B)=1, (A,C)=7, (A,D)=10, (B,C)=3, (C,D)=4, (D,E)=2. (Assume E is another vertex). If you apply Kruskal's algorithm, what is the sequence of edges added to the Minimum Spanning Tree (MST)?
      A (A,B), (D,E), (B,C), (C,D) Correct Answer Incorrect Answer
      B (A,B), (B,C), (C,D), (D,E) Correct Answer Incorrect Answer
      C (A,B), (D,E), (C,D), (B,C) Correct Answer Incorrect Answer
      D (A,B), (C,D), (D,E), (B,C) Correct Answer Incorrect Answer
      E (A,B), (D,E), (A,C), (B,C) Correct Answer Incorrect Answer

      Solution

      The correct answer is A

      Practice Next
      ask-question