man this is way too good, i fathom this algorithm rght away. This is 100x times better than my teacher's instructions, seriously. 2 weeks ago he taught me and my class this algorithm and he was like standing in front of the board 30 minutes talking and no one seemed to understand. It's great that i've found this. Thanks.
+Gia Phat Ha thanks for watching here is my algorithm playlist. you may find it helpful. ruclips.net/p/PLG6ePePp5vvYVEjRanyndt7ZSqTzillom thanks again for watching my video and commenting!
thank you guys for helping this video cross 100,000 views. thanks for your comments, appreciation, suggestions, love and support. and thank you guys for subscribing and helping my channel cross 10,000 subscribers! stay happy and keep smiling :-) #thankyou #yusufshakeel
really sir i simply love these videos even though our professors open their voice and said we cant understand anything but without voice just by the view we are understanding very well thank you sir
At first, I thought that this video will not be effective as the video contains no sound but instant change of mind after watching ur video. Great video. Keep it going
some teachers cant even make one understand with speech but yusuf sir is extremely blessed with an extraordinary talent of simplying albert einstein theory into a piece of cake for us..thank u sir ..really so impressed
I had confusion between prims and kruskals algorithm but the concepts of both the algorithms are clear to me now . Thanks to you for making such videos..... Thanks you So Much......!!!!!!!!!!
Yusuf you have done an excellent job brother !! It seems i dont need to attend college now !! you have made it very very simple !! thank you so much :)
رائع يا صديقي، أفضل بكثير من غير الناطقين بالانجليزية الذين يحاولون الشرح بالانجليزية لأجل الجوجل اديسنس فتخرج الدروس مزرية بسبب اللهجة السيئة، شكرا لك
This is the best video ever seen.... Was really helpful.. Thanks a lot sir... God bless you always... Keep sharing your knowledge... Knowledge sharing costs nothing.... God bless 👍
really good video. Goes to show a proper video doesn't need any speech to be effective. Just give clear, step-by-step instructions, show an example while giving the instructions, and you have a great video explaining things. Great job, way to keep it simple but effective
You should have faar more subscribers.You are under rated I feel. These are the best of videos.Thank you soo much.The best youtube channel for learning algorithm I feel :)
Another MST can be formed by choosing edge AC instead of AB and thus the MST becomes AC,BC,CD...If I am right then please add this information to this tutorial. Liked it very much...Thank you.
Yeah, but it's a logical coclusion coming out of the fact that the order in which ac and ab are insterted into the table is not important, becouse they have the same weight.
It's even a bit better without the speech because you may pause whenever you need to, and still can see what it's trying to say. Keep up with the good work
You should also add that for distinct edge weights, only a unique MST is possible. Since your example contained non-distinct edge weights two MSTs were possible.
Understandable Video but at the end we also have to find cost of Minimum Spanning tree by adding the weight of nodes. Like in this video the Minimum Spanning tree cost is => 2+1+3=6. :-)
+Atijav Dua Multiple MST's can exist. But as mentioned in the video we cannot choose AC as it will result in a closed circuit. If you are asking if we have a choice between AB and AC, it seems that we should go through every single edge and the questions will come up in such a way that there will conveniently one edge will be removed.
+Pratik Gupta i am working on those topics, videos will be released next year. kindly subscribe to catch the latest updates. thanks again for watching my videos and commenting :-)
Awesome tutorial! One question though, is it required to calculate? "Weight of MST" as : Weight of MST=2+1+3=6 Or should we just represent the MST obtained at the end of the above tutorial?
Good tutorial....I have a question. The other MST can be created using AC before AB. So new MST will be AC - 2, BC - 1, CD - 3. This new one even seems better than the one explained in this tutorial. See the comparison here: Lets Call AC, BC & CD as Tree 1. And AB, BC & CD as Tree 2. For Tree 1: Spanning from A to B = 3 Spanning from A to C = 2 Spanning from A to D = 5 For Tree 2: Spanning from A to B = 2 Spanning from A to C = 3 Spanning from A to D = 6 Can anyone help?
+Aditya Joshi I didn't understand your examples tree 1 ( spanning from A to B =3) and tree 2 ( spanning from A to D =6) but i got the same doubt in taking AC or AB. In note he explained that if we have two or more edges with same weight then we can write any order in the edge table....
While forming MST, it is okay to select any edge in case their weights are same. Of course you would obtain a different MST according to your choice of edge, but it's completely alright. There may exist more than 1 MST for a connected graph. So in your case, both the trees are right.
You are a real genius bro.... without speaking you teach like a boss.... keep it up... But where i will get the c++ code,,, In DYclassroom i found some algorithm code of your lecture,,,, but i searched there but i can't find this algorithm code... very impatient to solve this in code.. please help...
![AI VOICE CHANGER 2024! EASY! [NEW BETTER]](/img/1.gif)
Even without speech, this tutorial was more effective than any other. Keep it up!
AlphaOmega thanks for watching :-)
AlphaOmega all that fake accents and then music....ahh nice explanation yousuf ... bravo
man this is way too good, i fathom this algorithm rght away. This is 100x times better than my teacher's instructions, seriously. 2 weeks ago he taught me and my class this algorithm and he was like standing in front of the board 30 minutes talking and no one seemed to understand. It's great that i've found this. Thanks.
+Gia Phat Ha thanks for watching
here is my algorithm playlist. you may find it helpful.
ruclips.net/p/PLG6ePePp5vvYVEjRanyndt7ZSqTzillom
thanks again for watching my video and commenting!
thank you guys for helping this video cross 100,000 views.
thanks for your comments, appreciation, suggestions, love and support.
and thank you guys for subscribing and helping my channel cross 10,000 subscribers!
stay happy and keep smiling :-)
#thankyou
#yusufshakeel
it crossed !
thanks a lot my exam after 2 hours and i am cleared
jazakAllah
Keep it up Dude.
Barath Kumar.E thanks :-)
Respect from ITMO University, Saint-Petersuburg !
always saves my life and exams.
Very helpful tutorials.
Allah will give you jannah Insha Allah
This is one of the best channel for computer Science students. Thanks alot mate.:-)
hope you will find my website helpful too :-)
www.dyclassroom.com
Thanks for the video. I can not believe that you successfully taught me Kruskal's algo without telling even a word
really sir i simply love these videos even though our professors open their voice and said we cant understand anything but without voice just by the view we are understanding very well thank you sir
At first, I thought that this video will not be effective as the video contains no sound but instant change of mind after watching ur video. Great video. Keep it going
some teachers cant even make one understand with speech but yusuf sir is extremely blessed with an extraordinary talent of simplying albert einstein theory into a piece of cake for us..thank u sir ..really so impressed
One of the simplest and efficient way to teach algorithm -- Thanks a lot, will prefer to learn any algorithm from your channel..
I have test in 2hrs. Thanks alot.
My go to Algo revision Channel. Bless you, Yusuf!
One of the best teachers i know
Thanks Yusuf
great video sir. Even without any speech on the video, this is much more informative ! Thanks a lot!
LOL, I was absent when our professor explained this, never thought it was this easy. THANKS, plus your video makes it much easier..
+Ravenrey Kaamiño thanks for watching :-)
for a moment I was struggling to connect my earphones properly... lol
:-)
thank you very much sir.... 8 marks covered :)
Thanks for watching :-)
I had confusion between prims and kruskals algorithm but the concepts of both the algorithms are clear to me now . Thanks to you for making such videos..... Thanks you So Much......!!!!!!!!!!
welcome :-)
Yusuf you have done an excellent job brother !! It seems i dont need to attend college now !! you have made it very very simple !! thank you so much :)
welcome and please do attend college :-)
رائع يا صديقي، أفضل بكثير من غير الناطقين بالانجليزية الذين يحاولون الشرح بالانجليزية لأجل الجوجل اديسنس فتخرج الدروس مزرية بسبب اللهجة السيئة، شكرا لك
Thank you sir.. You taught me 8 marks..
Prim's algo - 8 marks
Total 16 marks ... superrr
Thank you so much! You have no idea how easy this and all your videos have made it. Best wishes
Even though this video does not have audio but still it is awesome . every thing has been cleared easily. simplicity at its best......
This is the best video ever seen.... Was really helpful.. Thanks a lot sir... God bless you always... Keep sharing your knowledge... Knowledge sharing costs nothing.... God bless 👍
Your videos are quite simple and easy to understand... Thanks
This one is sooooo simple but easy to understand... thanks a lot....
thanks, Yusuf Shakeel, perfect video.......Silent but your knowledge makes this video Louder.
great video..thumbs up for you sir
By far the best tutorial on youtube. Thank you unknown friend
Amine Laifi thanks for watching :-)
really good video. Goes to show a proper video doesn't need any speech to be effective. Just give clear, step-by-step instructions, show an example while giving the instructions, and you have a great video explaining things. Great job, way to keep it simple but effective
Chad Smith thanks for watching and appreciating my work :-)
You should have faar more subscribers.You are under rated I feel.
These are the best of videos.Thank you soo much.The best youtube channel for learning algorithm I feel :)
thanks for appreciating :-)
Great job brother! Please continue creating such clean and effective Step by Step guides! May Allah bless you!
Thank you, it is very hard to find good youtube videos about these kinds of subjects! This was very useful to me!
+iamarobotbeepbeep thanks for the appreciation
This is helpful. I need to give a presentation on the topic in morning. Thanx a lot
You are awesome without any vocie u explained it in a simple way Thank You😀
Thanks bro!!! Good explanation, I got it in the first attempt, that's the reason I didn't needed to rewind the video!!!😄
Oh man thank you so much i was having an exam in this couple of minutes before and i watched this video u saved me
hats off yusuf Shakeel . very well explained . keep the good work going
sir you are .......................................................... ""LIKE A PRO ".keep going :)
+K!RAN BANGAR thanks for watching my video!
Excellent!!....Best!!! ...made me understand this concept in first time...
+Manpreet Kaur thanks for commenting :-)
thanks sir..12 marks have been covered..cheers
best tutorial I've seen
+Rishi Rajput thanks!
sir...
thanks a lot... u have saved my time....
keep doing tutorials...ur tutorials r very helpfull...!!
+vijay nayak thanks for watching :-)
here is the algorithm playlist goo.gl/Z89n9o
hope you will find it interesting.
thank you sir...
playlist is very useful.
u have saved me...!!
Big like man! I finally understood this algoritm! Great tutorial!
Thanks so much, this helped a lot! Even without audio, you aced it!! Thanks again!
the best of the best of the best tutorial without a second sound .
thanks KS for this amazing video 😀👍👍
thank u sir for ur tutorials.These r life saver for students like me
thanks for watching :-)
Very cleanly done. Quick, simple and great explanation. Thanks! :)
like the style of your tutorials.. simple and clear.. subscribed bro!
thanks for watching and subscribing :-)
Wow really great without audio we can easily learn by this video
This video is really good! Simple but really understanding! Thank you so much!
Thanks alot bro, learnt kruskal and prism from u. JazakAllah
Another MST can be formed by choosing edge AC instead of AB and thus the MST becomes AC,BC,CD...If I am right then please add this information to this tutorial. Liked it very much...Thank you.
Yeah, but it's a logical coclusion coming out of the fact that the order in which ac and ab are insterted into the table is not important, becouse they have the same weight.
It's even a bit better without the speech because you may pause whenever you need to, and still can see what it's trying to say. Keep up with the good work
the best. thank you very much mr Yusuf. you have gained a subscriber.
You should also add that for distinct edge weights, only a unique MST is possible. Since your example contained non-distinct edge weights two MSTs were possible.
really u are awesome ...
i want to hear your voice atleast once
Understandable Video but at the end we also have to find cost of Minimum Spanning tree by adding the weight of nodes. Like in this video the Minimum Spanning tree cost is => 2+1+3=6. :-)
DAMN DUDE, THANK YOU. SO EFFECTIVE, NO BS!
The best in many that I have seen... Well Done ;)
thanks for watching :-)
Tomorrow my SEM exam Very clear thks a lot
xlnt smpl straight forward. very useful for final review for exams
thanks for watching :-)
Keep it up +Yusuf bhai...👏👏👏
Very nice explanation. Thank you.
simple and straight foward....thankx man
+omah 94 welcome
Outstanding sir
jazakaALLAH
+Naza hameed Jan thanks :-)
thnq so much..i don't know kruskal algorithm..u r video help me to slove promblem pn this algorithm
What happens if I select AC rather than AB as they have the same weight? Is it still a minimum spanning tree or is that solution always unique?
+Atijav Dua It's still a MST, alternate solutions can exist.
+Atijav Dua Multiple MST's can exist. But as mentioned in the video we cannot choose AC as it will result in a closed circuit. If you are asking if we have a choice between AB and AC, it seems that we should go through every single edge and the questions will come up in such a way that there will conveniently one edge will be removed.
Excellent video and diagrams! Thank you for sharing!
+Emily Huang thanks for watching :-)
Thank you! I have the test tomorrow.
Is it allowed to take edge AC, after the first one (BC)?
It's really awesome tutorial.thanks buddy.
Incredible tutorial brother !!
Thanx for this video it is a easy way to understand this algorithm
Will both algorithms would work for directed graphs ? If Yes, the how?
Thanks.
The best explanation !! Thanks a lot.
If the parallel edges have same weight then which edge we had to remove
Thank you so much.. It helped me a lot :) :) This is the best tutorial !
very helpful :) thank you for your positive videos :) have a nice day too
1 hour of learnig = 10 min of learning
thanks
+Abdul WWaheed thanks for watching
Nice and clean explanation.
Thank you for this tutorial, it was nicely done! :)
well done and this was very good explained
very nicely explained! make more tutorials like these
there is the playlist goo.gl/Z89n9o
hope you find it helpful. and thanks for watching :-)
Really awesome explanation thanks......
What if we select AC before AB? I still see a spanning tree without a circuit being formed.Thank you
it will not matter since you will get the same weight
shukriya yusuf bhai u made it lot easy to understand even a dumb can follow
+anirban chowdhury thanks for watching :-)
Excellent tutorial!
yr videos r vry hlpful...plz make a whole course vid for data structure and c if possible.
+Pratik Gupta i am working on those topics, videos will be released next year. kindly subscribe to catch the latest updates. thanks again for watching my videos and commenting :-)
yousaf shakeel great job. God bless u
Awesome tutorial!
One question though, is it required to calculate? "Weight of MST" as :
Weight of MST=2+1+3=6
Or should we just represent the MST obtained at the end of the above tutorial?
Weight can be written.
Yusuf Shakeel Thank you :)
Very nice video...thanks!
For example, I have 7 verteces, are you saying that the MST should only have 6 ?
Thanks Yusuf bhai...... thanks a tonne!
Hi, Can AC, BC and CD also be an MST???
I guess its an Yes
Sir, when you choose BC, DC and BD it form a cycle therefore I find that the MST contains a cycle which is against the property of a MST.
awsome , there is no words, thanks a lot
Good tutorial....I have a question. The other MST can be created using AC before AB. So new MST will be AC - 2, BC - 1, CD - 3. This new one even seems better than the one explained in this tutorial. See the comparison here:
Lets Call AC, BC & CD as Tree 1. And AB, BC & CD as Tree 2.
For Tree 1: Spanning from A to B = 3
Spanning from A to C = 2
Spanning from A to D = 5
For Tree 2: Spanning from A to B = 2
Spanning from A to C = 3
Spanning from A to D = 6
Can anyone help?
+Aditya Joshi I didn't understand your examples tree 1 ( spanning from A to B =3) and tree 2 ( spanning from A to D =6) but i got the same doubt in taking AC or AB. In note he explained that if we have two or more edges with same weight then we can write any order in the edge table....
While forming MST, it is okay to select any edge in case their weights are same. Of course you would obtain a different MST according to your choice of edge, but it's completely alright. There may exist more than 1 MST for a connected graph.
So in your case, both the trees are right.
You are a real genius bro.... without speaking you teach like a boss.... keep it up... But where i will get the c++ code,,, In DYclassroom i found some algorithm code of your lecture,,,, but i searched there but i can't find this algorithm code... very impatient to solve this in code.. please help...
thank u sir for giving us this video really helpful !!!!!
nice sir g ......very helpul for me .....