Question: In kruskals MST algorithm when applied to a graph with 24 vertices we have obtained connected components having sizes 3, 6, 7, 8. Using weighted
In kruskals MST algorithm when applied to a graph with 24 vertices we have obtained connected components having sizes 3, 6, 7, 8. Using weighted union give allmpossible scenarios as well as the minimum and maximum nuber of possible operations needed to get an MST.
Problem 3. (15 pts) in Kruskal's MST Ngorithm whco applied to a graph with 24 vertices we have obtaltiod connected componenta having iizes 3 e, 7, 8. Using wel ghted unico, give all po sible scenarios na well the mlrilmum and maximurb number of possible operatiotis needed to get an MST
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
