Minimum spanning tree: Prim and Kruskal
- Advanced
- Module 2 of 3 in this level
- Open to learn
Watchदेखें
L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm
- Gate Smashers
- English
- 11 min
11:17Gate SmashersWhat you should understandआपको क्या समझना है?
- A minimum spanning tree connects all vertices with least total edge weight.
- Kruskal sorts edges and adds each one that does not form a cycle, using DSU.
- Prim grows the tree from one vertex using a priority queue.
Watch the video to unlock this stepइस step को खोलने के लिए video देखें
About this videoइस video के बारे में
About the teacher: Gate SmashersTeacher के बारे में: Gate Smashers
Gate Smashers: Computer science subjects including networking, DBMS, operating systems and digital electronics.
Hindi lectures with structured explanations of technical concepts. Suits: Computer science students and technical exam aspirants.
Gate Smashers के videos YUNOVA पर Affiliate Marketing, Agile and Scrum, AI Tools & Prompting आदि सीखने में शामिल हैं।
All YUNOVA topics taught by Gate Smashersइस teacher के सभी YUNOVA topics देखेंLearners' questions on this topicइस topic पर learners के सवाल
Sign in to read the community's questions or ask yours.Community के सवाल पढ़ने या अपना सवाल पूछने के लिए sign in करें।
Sign in