In this video, we will discuss about Kruskal's Algorithm which is a very famous Greedy Algorithm used to find the minimum spanning tree (MST) of a given connected weighted undirected graph.
Topics covered in the video-
1) Prim's Algorithm and Kruskal's Algorithm Intoduction
2) Steps for Implementing Kruskal's Algorithm
3) Problems illustrating how to apply Kruskal's Algorithm on any given graph
For details, please watch the video.
Get these handwritten notes from website here-
https://www.gatevidyalay.com/kruskals-algorithm-kruskals-algorithm-example/
Prim's Algorithm and Kruskal's Algorithm are important topics for semester examination as well as competitive examinations like GATE, NET etc.
Watch the complete Algorithms Tutorials here-
https://www.youtube.com/watch?v=H4Ifnffy3Ts&list=PLwmA1T37CsHpuqdquKCmAJeScAhOCStLI
Follow us on-
LearnVidFun Facebook : https://www.facebook.com/learnvidfun
Gate Vidyalay Facebook : https://www.facebook.com/GateVidyalay
Gate Vidyalay Website : https://www.gatevidyalay.com
For any doubts/ queries, please comment below...
Please...Like, share and comment if you really gained something from this video and don't forget to subscribe yourself for getting the latest updates!
Your support really encourages us to do better....Thank you!! :)
All the best...Keep learning :)
