πŸ“Š Design and Analysis of Algorithms
Q. Consider the graph shown below. Which of the following are the edges in the MST of the given graph?
  • (A) (a-c)(c-d)(d-b)(d-b)
  • (B) (c-a)(a-d)(d-b)(d-e)
  • (C) (a-d)(d-c)(d-b)(d-e)
  • (D) (c-a)(a-d)(d-c)(d-b)(d-e)
πŸ’¬ Discuss
βœ… Correct Answer: (C) (a-d)(d-c)(d-b)(d-e)

Explanation: the minimum spanning tree of the given graph is shown below. it has cost 56.


Explanation by: Mr. Dubey
the minimum spanning tree of the given graph is shown below. it has cost 56.

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
737
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
84%
Success Rate