This is a demo of Kruskal's Algorithm on Minimum Spanning Tree (MST) with pseudocode walkthrough. The example of the graph is from CLRS (Chapter 23.2 the algorithms of Kruskal and Prim). The code is not. Since the basic version is for you to understand the logic, Union-Find is not shown in the code to reduce the complexity.
I'm making a few demo videos which don't contain any voiceover. They explain themselves by animation.
[About this channel] Compsyc for Computer Psychology :) I make videos for beginners.
[Animation engine] Manim(CE) with Python
[Copyright] 1) Pseudocode and the graph is found on CLRS.
