11 Oct 21 Lecture – 33 Prims Algorithm for Minimum Spanning Trees by Nathanael Kuvalis Articles Blog Tags: algorithm, for, minimum, Prims, spanning, trees Previous: Student experience in the School of Computer Science Next: Increase Height | Grow Taller | How To Increase Height Related posts Coding as Computer Science Student (reviewing my code after 5+ years as professional) October 23, 2019 Nathanael Kuvalis 0 Running a PIL Simulation with TRACE32® October 23, 2019 Nathanael Kuvalis 0 The NEW Facebook Algorithm – Tips & Tricks for 2019 October 22, 2019 Nathanael Kuvalis 10 SEDIBENG TVET COMPUTER SCIENCE DEPARTMENT October 21, 2019 Nathanael Kuvalis 0 Introducing the nRF52833 DK October 21, 2019 Nathanael Kuvalis 0 PPC Management Software for Agencies October 20, 2019 Nathanael Kuvalis 0 About The Author Nathanael Kuvalis 21 Comments Alister Abreu says: June 15, 2009 at 6:00 pm sir if you could use the matrix method as taught by greenford maths it would be most clear and mu life would have been better Reply Vivek Verma says: December 16, 2009 at 4:15 pm @daanishaman man dont be so cheap……order these lectures from NPTEL they cost only 200 rs for the whole course……..if people like you pay then NPTEL gets a boost and maybe you all can get more of these lectures Reply Mark Williams says: January 14, 2010 at 11:01 am find a firefox addon to download google videos or you could take it from your temporary internet files Reply Arlekean says: June 10, 2010 at 12:24 am Thank you so very much for this serie of vids… but I must say you're not a good explainer. Reply xdiz says: August 2, 2010 at 4:02 pm the intro is hilarous Reply rahul pogula says: November 8, 2010 at 11:06 am thank u very much sir it was really helpful for me Reply Viswanathan Suresh says: February 2, 2011 at 10:37 pm This lecture series is a boon to many students and practitioners. I just dont understand some of the negative comments below. Suresh Strasbourg/France Reply Vaibhav Dubey says: April 17, 2011 at 3:20 pm thank u so much sir… u made lot f confusion clear in mah mind.. 🙂 Reply Nandakumar Natarajan says: July 27, 2011 at 5:53 pm Too much of confusion for a simple concept. Reply Error 404. Name not found. says: October 24, 2011 at 10:14 am Very well explained sir!! 🙂 🙂 🙂 Reply Madiha Salman says: November 9, 2011 at 9:44 am All lectures of this lecturer are very nice ,easy to understand Reply Jaspreet Singh says: November 14, 2011 at 8:03 am thanx i wish u were ma teacher Reply TheFancylife says: December 24, 2011 at 7:40 am thnx it helps me alot in my presentation Reply bbababonbon..bonfire! says: September 10, 2012 at 1:06 am best opening score ever! Reply Ali Ebrahimi says: February 25, 2013 at 8:13 am I believe that Dr. Naveen is so cleaver and generous. I like so mcuh the way Indian Profs put their knowledge free to all people. I really appriciate that. Thanks a lot again Reply shubhi says: March 10, 2013 at 1:12 pm made uunnecessarily complex due to discussion with students Reply bhakta pradhan says: November 17, 2013 at 2:11 am Thank you Sir …such an excellent explanation ….you turned a tough concept into a cakewalk Reply Sreejith M M says: January 11, 2015 at 1:37 pm There is a small confusion in this lecture. At first, concept is explained in a way that edges are stored in the heap. Later, it is changed to vertex. The mistake in this lecture is explained in lecture 34 by the lecturer. It is better to see lecture 34 before 33. Reply suraj ghosh says: October 4, 2015 at 6:41 am i have a suggestion sir,,, why not decrease the priority of the vertex we have added to the S side by infinity such that the vertex already added gets at the bottom of the heap… then instead of checking whether heap is empty or not….. we could just check the topmost element in heap has a priority of infinity… assuming we store priority along with vertices… then remove operation need not be done Reply prasad patil says: January 24, 2017 at 6:13 am oh my right ear :p Reply ravi soni says: December 9, 2018 at 12:05 pm thnku soo much sir. till lecture 33 i have watched all your lectures & you have cleared my all doubts..at last i will thanks to nptelhrd for providing this great video lectures to students.. thnkuuRavi Soni Reply Leave a Reply Cancel reply Your email address will not be published. Required fields are marked *Comment Name * Email * Save my name, email, and website in this browser for the next time I comment.