IGI (1) : LL 1 algorithm kruskal(G): 2 3 4 5 6 7 8 9 10 9 1 7 G 7 E if there are V-1 edges in mst: 5 A 7 8 9 3 B Kruskal () Input: graph G containing V vertices and E edges 6 D edges = list of edges of G sorted by weight mst = create new graph with V vertices and no edges for each edge (v, w) in edges: if there is no path between v and w in mst: add edge (v, w) to mst 4 Pol G