Kruskal's Algorithm Sorts edges and adds them if they don't create cycles Prim's Algorithm Grows the MST one vertex at a time Borůvka's Algorithm Finds minimum edge for each component simultaneously Reverse Delete Algorithm Removes heaviest edges while keeping graph connected Running... Graph Presets SimpleTextbookComplex