File:Kruskal Algorithm 2.svg

Transferred from en.wikipedia to Commons by Maksim. The original description page was here. All following user names refer to en.wikipedia. Legend: (cur)

in Kruskal's algorithm: An example of a complete network. Each dot is a vertex, and can be turned into a tree on its own. Use the Kruskal's algorithm to

DescriptionDsa minimum spanning tree kruskal 2.png Kruskal's algorithm 2. Source Own work Author Thedsadude

DescriptionDsa minimum spanning tree kruskal 1.png Kruskal's algorithm 1. Source Own work Author Thedsadude