filmov
tv
L-4.9: Prim's Algorithm for Minimum Cost Spanning Tree | Prims vs Kruskal
Показать описание
👉Links for DAA Notes:
🧑🎓Contributed by: Junaid Gazi
🧑🎓Contributed by: Mannu Garg
In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. How Prims algorithm actually works and How it is different from Kruskal. All Explained with examples.
► Design and Analysis of algorithms (DAA) (Complete Playlist):
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Комментарии