Skip to content

3.5 Prims and Kruskals Algorithms - Greedy Method

Abdul Bari1.33M subscribers

3,917,151 views

About this video

Hand-picked by a BrighterTube curator · found via ErikCH/DevYouTubeList

Works Prim's and Kruskal's minimum-spanning-tree algorithms by hand on example graphs and compares when each fits; Abdul Bari's whiteboard method is a staple for algorithms students.

Prim's and Kruskal's algorithms for minimum spanning trees, worked by hand on example graphs.

Video by Abdul Bari, played through YouTube's embedded player.

Part of Algorithms