Data Structures and Algorithms20745 marksDefinition and Representation of Graphs, Graph Traversal, Mi
Discuss the Kruskal's algorithm with example.
Discuss the Kruskal's algorithm with 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 selecting edges in increasing order of weight, skipping any edge that would form a cycle. --- 1. Sort all edges of the graph in non-decreasing or...