Skip to content

Lecture - 33 Prims Algorithm for Minimum Spanning Trees

nptelhrd2.25M subscribers

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Teaches Prim's algorithm for minimum spanning trees. Lecture on greedy approach finding lowest-cost tree covering all vertices.

Video by nptelhrd, played through YouTube's embedded player.

Part of Computer Sc - Data Structures and Algorithms