Prim's Algorithm | Minimum Spanning Tree | Graph Algorithm | MST Part 1

Prim's algorithm (also known as Jarník's algorithm) is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.

Part 1. Prim's Algorithm

# Minimum Spanning Tree (MST)

## Part 1. Prim's Algorithm

## Part 2. LeetCode 1584. Min Cost to Connect All Points

## Part 3. Kruskal's Algorithm

## Part 4. LeetCode 1135. Connecting Cities With Minimum Cost