Support us on Patreon: / geekific
Discord Community: / discord
GitHub Repository: github.com/geekific-official/
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:
- Object-Oriented Programming Fundamentals: • What is Object-Oriente...
- SOLID Principles and Best Practices: • SOLID Design Principle...
- Recursion Made Simple, Recursive Methods: • What is Recursion? | R...
- Use-Case and Sequence Diagrams: • UML Use-Case and Seque...
- Graphs, The Fundamentals: • Introduction to Graphs...
- Trees Compared and Visualized, BST vs AVL vs Red-Black vs Splay vs Heaps: • Trees Compared and Vis...
- Dijkstra's Algorithm Explained and Implemented in Java: • Shortest Path | Dijkst...
- Ford-Fulkerson Algorithm Explained and Implemented in Java: • Max Flow | Ford-Fulker...
- Generics and Wildcards in Java, Invariance vs Covariance vs Contravariance: • Generics and Wildcards...
#Geekific #Prim #GraphTheory #MinimumSpanningTree