Computer Sc - Data Structures and Algorithms - Lecture - 33 Prims Algorithm for Minimum Spanning Trees

4.0 (2)

16 learners

What you'll learn

This course includes

32.5 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

Prims Algorithm for Minimum Spanning Trees

Full Transcript

Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Welcome