A Guide to Minimum Spanning Trees: Kruskal's vs. Prim's Algorithm

Minimum Spanning Tree (MST) A Minimum Spanning Tree of a connected, undirected, weighted graph is a subset of edges that: Connects all vertices without cycles. Has the minimum possible total edge weight. 1. Kruskal’s Algorithm Idea: Kruskal’s al...