143,453 views
Description of Kruskal's algorithm which takes as input a weighted connected graph and builds/extracts a minimum weight spanning tree. This very classic algorithm has the same objective (but not the same operation) as Prim's algorithm to which I have already dedicated a video.