CSE { computer science & engineering } Video Lectures.
In this Lecture you will be learning about the Kruskal's Algorithm.
Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step.
For more info / doubt write us at our mail or comment below.
PLEASE LIKE , SHARE & SUBSCRIBE
