Compare MST Algorithms

Compare Minimum Spanning Tree algorithms side-by-side and witness how three distinct greedy strategies explore the same graph to find its MST. While Prim's grows a single tree vertex by vertex, Kruskal's builds the MST by sorting and selecting the cheapest edges globally, and Borůvka's focuses on connecting closest components in parallel steps. Sketch your custom weighted graph and hit the play button to see these foundational algorithms in action.