5.5.2 Minimum spanning trees .o Definition 24: A minimum spanning tree in a connected weighted graph is a spanning tree that has the smallest possible sum of weights of its edges. ☆ Prim algorithms 冷 Kruskal’ s algorithms5.5.2 Minimum spanning trees ❖ Definition 24: A minimum spanning tree in a connected weighted graph is a spanning tree that has the smallest possible sum of weights of its edges. ❖ Prim algorithms ❖ Kruskal’s algorithms