Comparative applications of Prim's vs Kruskal's algorithm in real life scenarios. Have you ever wondered how do Google maps find the best route to your destination? Well, it doesn’t practically read the maps, but uses some algorithms to determine the shortest path to your destination. Although it involves other complications too, such as analyzing the traffic or finding alternative routes if the roads are temporarily blocked etc., the task is solved using the concepts of graph theory. The network of roads is considered as a directed graph with intersection of roads and landmarks to be vertices and the roads to be edges. In this article, we would be comparing some real life applications of Kruskal’s and prim’s algorithms which are basically used to route the shortest length of the path in a network. Speaking in graph theory terminologies, these algorithms are used to find the minimum spanning trees (MST). Spanning tree is the sum of weights on all edges of the tree. A...
