Sort the graph edges with respect to their weights.

Kruskal's algorithm follows greedy approach as in each iteration it finds an edge which has least weight and add it to the growing spanning tree. Kruskal’s Algorithm builds the spanning tree by adding edges one by one into a growing spanning tree. There are two famous algorithms for finding the Minimum Spanning Tree: Kruskal’s Algorithm It is used in algorithms approximating the travelling salesman problem, multi-terminal minimum cut problem and minimum-cost weighted perfect matching. Minimum spanning tree has direct application in the design of networks. There also can be many minimum spanning trees. Minimum spanning tree is the spanning tree where the cost is minimum among all the spanning trees.

The cost of the spanning tree is the sum of the weights of all the edges in the tree. Given an undirected and connected graph $$G = (V, E)$$, a spanning tree of the graph $$G$$ is a tree that spans $$G$$ (that is, it includes every vertex of $$G$$) and is a subgraph of $$G$$ (every edge in the tree belongs to $$G$$) What is a Minimum Spanning Tree? Pre-requisites: Graphs, Trees What is a Spanning Tree?

Graphpad prism tutorial multiple groups