Kruskal's Algorithm by Dr. D Sree Lakshmi

Kruskal's Algorithm by Dr. D Sree Lakshmi | IARE

#KruskalsAlgorithm #MinimumSpanningTree #GraphTheory #GreedyAlgorithm #DisjointSet #DataStructures #ComputerScience

Kruskal’s Algorithm is a greedy algorithm used to find a Minimum Spanning Tree (MST) of a connected, weighted undirected graph.

It works by sorting all the edges and adding the smallest edge to the MST as long as it doesn't form a cycle.

Website Link :- https://www.iare.ac.in/
Akanksha Link :- https://akanksha.iare.ac.in/
YouTubeLink :-    / @iarehyderabad  
Facebook Link :-   / iareofficial  
Instagram Link :-   / iare_hyderabad  
Flickr Link :- flickr.com/photos/186282793@N05/albums

#marrirajasekharreddy
Instagram Link :-   / marrirajasekar  
Facebook Link :-   / trsrajasekhar  
Twitter :- https://x.com/marrirajasekar
LinkedIn :-   / marri-rajasekhar-reddy-69a06844  

Institute of Aeronautical Engineering
Dundigal, Hyderabad – 500 043,
Telangana, India.
Phone:8886234501, 8886234502,
040-29705852, 29705853, 29705854
Email: [email protected],
[email protected]

#KruskalsAlgorithm #MinimumSpanningTree #GraphTheory #GreedyAlgorithm #DisjointSet #DataStructures #ComputerScience