How does Kruskal algorithm work? Illustrate with an example. | Discrete Structure 2080.1

Discrete Structure2080.15 marksKruskal's algorithm

How does Kruskal algorithm work? Illustrate with an example. [5]

Kruskal's algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, undirected, weighted graph. It builds the MST by always picking the smallest available edge that does not form a cycle. --- 1. Sort all edges in non-decreasing order of their weights. 2. Initial...

← PreviousAll questions Next question →

Up nextState generalized Pigeonhole principle. How many ways can we get the 3 digit integers with