Перейти к содержимому

L-4.9: Prim's Algorithm for Minimum Cost Spanning Tree | Prims vs Kruskal

Gate Smashers

0:00 / 0:00

L-4.9: Prim's Algorithm for Minimum Cost Spanning Tree | Prims vs Kruskal

2 661 640 просмотров · 5 лет назад
Gate Smashers
2,84 млн подписчиков
2 661 640 просмотров · 5 лет назад
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 by Varun sir in this video. #algorithm -------------------------------------------------------------------------------------------------------------------------------------- Timestamps: 00:08 - Introduction to Prim's Algorithm 01:06 - What is Minimum Cost Spanning Tree? 02:10 - Graph Explanation of Prim’s Algorithm 06:05 - Prim's v/s Kruskal’s Algorithm -------------------------------------------------------------------------------------------------------------------------------------- 🚀 MASTER COMPUTER SCIENCE | INTERVIEWS | EXAMS Gate Smashers — Learn Computer Science through free lectures, structured playlists, interview resources, important questions, notes & exam preparation. 💻📚 🌐 FREE CS RESOURCES & INTERVIEW PREPARATION : https://gatesmashers.com ━━━━━━━━━━━━━━━━━━━━━━ 📚 SUBJECT-WISE COMPUTER SCIENCE PLAYLISTS ► Placement Interview Questions:    • Placement Interview Questions | One Shot S...   ► System Design:    • System Design   ► Deep Learning:    • Deep Learning (ANN, RNN, Tranformers, RNN)   ► Machine Learning:    • Machine Learning   ► Design and Analysis of Algorithms (DAA):    • Design and Analysis of algorithms (DAA)   ► Software Engineering:    • Software Engineering   ► Database Management System (DBMS):    • DBMS (Database Management system) Complete...   ► Cloud Computing:    • Cloud Computing (Complete Course)   ► Theory of Computation (TOC):    • TOC(Theory of Computation)   ► Artificial Intelligence:    • Artificial Intelligence (Complete Playlist)   ► Computer Networks (CN):    • Computer Networks (Complete Playlist)   ► Operating System (OS):    • Operating System (Complete Playlist)   ► Structured Query Language (SQL):    • Structured Query Language (SQL)   ► Discrete Mathematics:    • Discrete Mathematics   ► Compiler Design:    • Compiler Design (Complete Playlist)   ► Number System:    • Number system   ► Programming in C:    • C Programming   ► Data Structures:    • Data Structure   ► Computer Architecture:    • Computer Organization and Architecture (Co...   ► Graph Theory:    • Graph Theory   ► Digital Logic:    • Digital Logic (Complete Playlist)   ━━━━━━━━━━━━━━━━━━━━━━ 🌐 CONNECT WITH GATE SMASHERS ► Website: https://gatesmashers.com ► YouTube:    / gatesmashers   ► Instagram:   / gate.smashers   ► Telegram: https://t.me/gatesmashersofficial ► Facebook:   / gatesmashers   ► Threads: https://threads.net/@gate.smashers GsetGo ► YouTube:    / @gsetgoofficial   ► Instagram:   / gsetgo_   VarunNainaShots ► YouTube:    / @varunainashots   ► Instagram:   / varunainashots   ━━━━━━━━━━━━━━━━━━━━━━ Subscribe to Gate Smashers and start your Computer Science learning journey today! 🚀💻