Theorem 5.18: Kruskal's algorithm produces a minimum spanning tree of a connected weighted graph. g Proof: Let g be a connected weighted graph, and T be the graph which is produced by Kruskal algorithm ☆ By theorem5.14 &T is a spanning tree of g❖ Theorem 5.18: Kruskal’s algorithm produces a minimum spanning tree of a connected weighted graph. ❖ Proof: Let G be a connected weighted graph, and T be the graph which is produced by Kruskal’s algorithm. ❖ By theorem 5.14 ❖ T is a spanning tree of G