In this video, I have explain How Kruskal's Algorithm Of Finding The minimum spanning tree of a graph works, i have explained how the algorithm works, then I've explained how Cycle detection works using Disjoint sets, where i have discuss the Union By rank method along with path compression, then the time and space complexitites of it followed by the python implementation. GitHub link for the code implementation:- tools used to make this video:- Manim (python library for making mathematical animations), premier pro (for video editing) and a TTS model for Voiceover.