Kruskal’s algorithm (Minimum spanning tree) with real-life examples

Most of the cable network companies use the Disjoint Set Union data structure in Kruskal’s algorithm to find the shortest path to lay cables across a city or group of cities. Which leads us to this post on the properties of Disjoint sets union and minimum spanning tree along with their example. Before we proceed with … Continue reading Kruskal’s algorithm (Minimum spanning tree) with real-life examples