Prim's Algorithm for Minimum Spanning Tree || Greedy || Min Heap

In this video I discuss about the Prim's algorithm to get the minimum spanning tree from the graph.

Chapters:
0:00 Introduction
0:41 Graph Basics
2:57 Implementation
8:52 Java Program

1. Introduction
This chapter gives basic introduction about Prim's algorithm.

2. Graph Basics
This chapter has the basics of graphs such as Undirected Graph, Directed Graph, Connected Graph, Weighted Graph, Spanning Tree, Minimum Spanning Tree, Minimum Spanning Forest.

3. Implementation
This chapter has the implementation of Prim's algorithm using Min Heap. It has one example to walk you through the algorithm. It also talk about the time & space complexity of the algorithm.

4. Java Program
This chapter has the Java Program for the Prim's algorithm.

#algorithm #graphs #prims #dsa #datastructures