Q. Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?

(A) (b-e)(g-e)(e-f)(d-f)
(B) (b-e)(g-e)(e-f)(b-g)(d-f)
(C) (b-e)(g-e)(e-f)(d-e)
(D) (b-e)(g-e)(e-f)(d-f)(d-g)

💬 Discuss

✅ Correct Answer: (A) (b-e)(g-e)(e-f)(d-f)

Explanation: using krushkal’s algorithm on the given graph, the generated minimum spanning tree is shown below.

Published by Mr. Dubey ⭐ 109.99K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

using krushkal’s algorithm on the given graph, the generated minimum spanning tree is shown below.

💬 Discussion

📊 Question Analytics

👁️

186

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

96%

Success Rate