Kruskal's Algorithm | Minimum Spanning Tree | Graph Algorithm | MST Part 3

Kruskal's algorithm (also known as Kruskal's method) finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree.

Hackerrank: https://www.hackerrank.com/challenges/kruskalmstrsub/problem
YouTube: https://youtu.be/x9JPYGPzQdM
Solution code: https://github.com/TheBaseCase/LeetCode/blob/main/MST/kruskal.cs

# Minimum Spanning Tree (MST)

## Part 1. Prim's Algorithm
Hackerrank: https://www.hackerrank.com/challenges/primsmstsub/problem/
YouTube: https://youtu.be/Xek_QwhPAp0
Solution code: https://github.com/TheBaseCase/LeetCode/blob/main/MST/prims.cs

## Part 2. LeetCode 1584. Min Cost to Connect All Points
LeetCode: https://leetcode.com/problems/min-cost-to-connect-all-points/
YouTube: https://youtu.be/JhN1yj3ZUX0
Solution code: https://github.com/TheBaseCase/LeetCode/blob/main/MST/1584.cs

## Part 3. Kruskal's Algorithm
Hackerrank: https://www.hackerrank.com/challenges/kruskalmstrsub/problem
YouTube: https://youtu.be/x9JPYGPzQdM
Solution code: https://github.com/TheBaseCase/LeetCode/blob/main/MST/kruskal.cs

## Part 4. LeetCode 1135. Connecting Cities With Minimum Cost
LeetCode: https://leetcode.com/problems/connecting-cities-with-minimum-cost/
LintCode: https://www.lintcode.com/problem/3672/
YouTube: https://youtu.be/xN3EUa-Fff4
Solution code: https://github.com/TheBaseCase/LeetCode/blob/main/MST/1135.java

Union Find
YouTube: https://youtu.be/fZNRMpVlJZs
Solution code (Quick Union): https://github.com/TheBaseCase/LeetCode/blob/main/UnionFind/quick_union.cs
Solution code (Weighted Union): https://github.com/TheBaseCase/LeetCode/blob/main/UnionFind/weighted_union.cs