Minimum Spanning Trees

Minimum spanning trees playlist

Prim's

• Video
• Hint: Prim's = Pick a node
• h/t Aladdin Persson – GitHub | YouTube

❯ python prims.py
Minimum spanning tree: [('A', 'B', 2), ('A', 'C', 3), ('C', 'E', 1), ('A', 'D', 3), ('C', 'F', 6), ('F', 'G', 9)]
Total cost: 24

Kruskal's

• Video
• Hint: Kruskal's = iterate through edges
• h/t Aladdin Persson – GitHub | YouTube

❯ pip install unionfind
❯ python kruskals.py
Minimum spanning tree: [('C', 'E', 1), ('A', 'B', 2), ('A', 'C', 3), ('A', 'D', 3), ('D', 'F', 7), ('F', 'G', 9)]
Total cost: 25