3.5 Prims and Kruskals Algorithms - Greedy Method

Whats a Spanning Tree ?
What is a Minimum Cost Spanning Tree?

Prims Algorithm
Kruskals Algorithm

Problems for Spanning Tree

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

[tonyzweb]

This man is an absolute legend. I can't be bothered to listen to my tutor when I can do a simple youtube search and be done with the current topic in less than 30 minutes. Thank you for your contribution to our CS society, and I'm looking forward to learn from you more things. I'm speaking on behalf of all the CS students here...
We thank you!

[sicals]

no ads, no subsrice-like-comment asking. You are a legend sir.

[abidkp]

It's a 6 year old video, Still people watching it.. quality matters 🔥💯

[bubkabu]

Abdul, you are one of the best computer science teachers on youtube. Keep it going!

[kapildeshpande]

07:46 Prims algorithm
11:33 Kruskals algorithm

[mashaido]

can I acknowledge the smooth relaxing tone that you use to deliver points across in a quick nutshell! It doesn't feel rushed, it's super soothing that I'm sure even those students with assignment deadlines are so chilled out right now as they follow through!

[hassanmonji]

Dear PhD.Abdul Bari,
Words fail to describe the amount of thanks and respect for your generosity
you are one of your kind, i have never seen a professional professor like you all the respect to you
the way you explain and teach the topics is exceptional
You are in the status of prophets
Kindest Regards
your student

[AdityaFingerstyle]

In Prim's Algorithm, it is not necessary to choose the minimum cost edge initially. 8:02
You can choose an arbitrary vertex V and then start building the tree from it.

[shamanthakrishnakg]

If u already know the meaning of minimum spanning tree skip to 7:35

[ragibshahariar]

You put away my depression and pressure that I was suffering. Thank you for your help. May Allah bless you and your family. I bought you C++ beginner to advanced course from Udemy. I hope I will buy Your Data structure and algorithm course also after finishing C++ course insha-Allah. Thank you sir.

[tanyasrivastava]

Sir you're the best teacher... without you I would not have even thought to pass DAA in my sems ♥ Love you loads

From your loving student 😇

[areebaaslam]

You are absolutely the best person who have skills how to convey knowledge...Even in the 9 months of Smester i can't understand what basically data structure is...just because of you I understand complete course of data structure in 3 days and even ready for exam tomorrow....I salute you man😍Allah give you more for this great work👍

[MarkMifsud]

I am at the end of an incredibly busy semester and my class ended up with only a couple of weeks to actually study for Data Structures & Algorithms 2. Your lectures are going to help me pass with flying colours. I like the way you give the simplest example to make your explanation easy & brief. From there I can manage the rest. Thank you very much Sir.

[abdulmuizzkelani]

In all Sincerity, this man deserves an award for his deep understanding of computer science logic and his amazing style of teaching, if @youtube should see this comment, please do something, cos I believe a very high number of students, not only computer science students benefit from his lectures.

[leooel]

This man seems to my eyes that he knows every single thing!
Sincerely, thank you!

[MsFerid]

This man is a legend, literally getting carried through this com sci degree

[kantimahantyrohit]

I watch your videos whenever I am stuck and the best thing is, not only you make us understand the topics but also clear the related and necessary concepts required to understand the topic. Thank you so much sir!!!

[irtikailahi]

So calm and patient teaching technique, , , it sounds so comforting and easy to learn from your videos, , thank you sir... 😊

[rico]

Hi sir ! Thanks for the gorgeous video.
I’ve noticed some wrong point in your video.
You explained how many MST can have the differ shape as formual E C (V-1) - no.cycle
But I think this is wrong and I think it should be fixed this way.
E C (V-1) -(Number of graphs containing cycles by selecting V-1 edge on E edge)
So, 7C5-(7) = 14.

[shrayasichakraborty]

Best thing about your videos->no time waste, straight to the point and very easy to grasp.