Kruskal’s Algorithm for Minimum Spanning Tree || Explanation with solved Example (urdu/hindi),

Kruskal’s algorithm is a greedy algorithm. It used to find the Minimum Spanning Tree (MST) from given weighted undirected graph. In this video kruskals algorithm for minimum spanning tree has been explained with help of example. To find out MST we apply following steps on given weighted graph. Step 1: Remove all loops Step 2: Remove all parallel edges between two Nodes (vertices) In case of parallel edges, keep the one which has the least cost (weight) Step 3: Arrange all edges in increasing order of weight (cost) Step 4: Add the edges which has less weight (cost) (repeat this step for all nodes).There should be no cycle. Kruskal’s Algorithm for Minimum Spanning tree Kruskal algorithm for Minimum Spanning Tree kruskal algorithm in urdu what is kruskal algorithm kruskal algorithm in hindi kruskal algorithm with example Explanation with solved Example minimum cost spanning tree minimum spanning tree using kruskal algorithm kruskal algo in urdu #AZComputing #KruskalAlgorithm #MST