Minimum Cost Spanning Tree | Prim's Algorithm Explained and Implemented in Java | Geekific

In one of our very first introductory graph videos we explained what spanning trees are. Basically, any graph can span multiple other graphs, but not just any graph, trees in particular. And that is what we call a spanning tree for this graph. In other terms, a spanning tree is a connected sub-graph, that contains all the graph vertices with the minimum possible number of edges; which is the number or vertices in the graph minus one. In this video, we explain and implement Prim’s algorithm, which is one way among many that identifies this minimum spanning tree.

Timestamps:
00:00 Introduction
00:28 What is Prim's Algorithm?
03:17 Prim's Algorithm Implementation
05:15 Putting our Code to Test!
06:10 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:

#Geekific #Prim #GraphTheory #MinimumSpanningTree

[svalyavasvalyava]

Thank you, great video, as always!!!

[manOfPlanetEarth]

0:03
"what's up geeks and welcome to the channel" 🤗🤗🥳🥳🥳

[halasyamv]

4:54 so much method refernces, so many anonymous classes