Kruskal's Algorithm using Animations
In this video I explained Kruskal's Algorithm in a different way.
I hope you will like this video.
Kruskal's algorithm to find the minimum cost spanning tree uses the greedy approach. This algorithm treats the graph as a forest and every node it has as an individual tree. A tree connects to another only and only if, it has the least cost among all available options and does not violate MST properties
Music:
PACIFIC SUN by Nicolai Heidlas Music / nicolai-heidlas
Creative Commons — Attribution 3.0 Unported— CC BY 3.0
http://creativecommons.org/licenses/b...
Music provided by Audio Library • Video