Kruskal's Algorithm

Minimum Spanning Tree (binary/octet-stream)

Rubrica: : Minimum spanning tree progression

Minimum spanning tree

Write down arcs in ascending order of weight Select arc with least weight as start of subtree Only add arcs that do not cause a cycle No need to continue if all vertices are connected through a tree  

Delightful Definitions!!!

Subgraph: part of the original graph Vertex: Arc  

Uses of Kruskal's Algorithm

Companies use Kruskal's Algorithm in project management. This enables the arcs to be time and the vertexes to be the tasks.