Kruskal's algorithm for a given graph - If all edge weights are distinct, the minimum spanning tree is unique. If two or more edges have same weight, then we have to consider all possibilities and find possible minimum spanning trees. 2 2. 2 1 1 1 1 2 2 2 a. The number of distinct minimum spanning trees for the weighted graph is_ (A) 4 (B) 5 (C) 6 (D) 7 b. Do they all have the same MST value? If not, what are the values?
Kruskal's algorithm for a given graph - If all edge weights are distinct, the minimum spanning tree is unique. If two or more edges have same weight, then we have to consider all possibilities and find possible minimum spanning trees. 2 2. 2 1 1 1 1 2 2 2 a. The number of distinct minimum spanning trees for the weighted graph is_ (A) 4 (B) 5 (C) 6 (D) 7 b. Do they all have the same MST value? If not, what are the values?
Related questions
Question
Transcribed Image Text:Kruskal's algorithm for a given graph -
If all edge weights are distinct, the minimum spanning tree is unique.
If two or more edges have same weight, then we have to consider all possibilities and find
possible minimum spanning trees.
2
2.
2
1
1
1
1
2
2
2
a. The number of distinct minimum spanning trees for the weighted graph is_
(A) 4
(B) 5
(C) 6
(D) 7
b. Do they all have the same MST value? If not, what are the values?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
