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

Veröffentlicht am: 17 September 2022
auf dem Kanal: Geekific

7,487

103

Discord Community:   / discord
GitHub Repository: https://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-Oriented Programming? | Obj...
SOLID Principles and Best Practices:    • SOLID Design Principles with Java Examples...
Recursion Made Simple, Recursive Methods:    • What is Recursion? | Recursion Made Simple...
Use-Case and Sequence Diagrams:    • UML Use-Case and Sequence Diagrams Made Si...
Graphs, The Fundamentals:    • Introduction to Graphs: the Fundamentals, ...
Trees Compared and Visualized, BST vs AVL vs Red-Black vs Splay vs Heaps:    • Trees Compared and Visualized | BST vs AVL...
Dijkstra's Algorithm Explained and Implemented in Java:    • Shortest Path | Dijkstra's Algorithm Expla...
Ford-Fulkerson Algorithm Explained and Implemented in Java:    • Max Flow | Ford-Fulkerson Algorithm Explai...
Generics and Wildcards in Java, Invariance vs Covariance vs Contravariance:    • Generics and Wildcards in Java | Part 2 | ...

#Geekific #Prim #GraphTheory #MinimumSpanningTree

Auf dieser Seite können Sie das Online-Video Minimum Cost Spanning Tree | Prim's Algorithm Explained and Implemented in Java | Geekific mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer Geekific 17 September 2022 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 7,487 Mal angesehen und es wurde von 103 den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!