Kruskal’s Algorithm and Example Kruskal’s Algorithm in data structure is another greedy approach used to find the cost of spanning tree. Generally it is used to find the minimum spanning tree in the given Graph. Problem based on Kruskal’s algorithm is generally asked in GATE(CS/IT) and UGC NET exam. In this tutorial we have explained […]
