Thank you very much for making this video. A lot of websites have wrong explanation of this Algorithm. I came to your video after wasting my time over there .Now I have your channel for all my remaining doubts.
Dear Yusuf, Thank you from the bottom of my heart for making such great videos. I had my exam today and bumped into your channel last night. Checked 5 of your videos and that helped me a lot today. You have made my day. Thank you once again!
You don't speak but the presentation is far way better than speaking. Awesome presentation. First ever video seen on youtube that explains concepts without speaking and that too step by step. Thank you.
thanks mate, i was studying for my data structure exam and feeling so depressed, but i now feel better after i saw "stay happy and keep smiling". Thanks for your encouraging ^^
It's really nice! Mathematics Dircrete is my most difficult subject. But.. only watch this video, it look so easy. Thanks u very much. You saved my life in university
thank you guys for helping this video reach 100K views. you guys are awesome. check out my other videos that i am uploading on sundays at 10am. see you in the next video. stay happy and keep smiling :-)
Man, you are great! :) Before I start to read I just watch you video and create some picture in my mind. Then it helps to understand algorithm during reading materials, thank you so much!
+Turxan Badalov thanks for the appreciation. each morning i check comments and the love and appreciation i receive encourages me to make more interesting videos. thanks again for watching and commenting :-)
i watch your tutorial first time than i think there is no voice than how it is understandable but when i complete this tutorial its Ausome bro very nice
Assalamu Alaikum (varah..) sir...your explanation was Excellent that is used to presented my seminar clearly.. continue this process to other maths papers thank you
consider a 5*5 matrix , if we got 2 same values in when finding smallest value in 1st two rows , or 3 values when considered 1st three rows . then what edge is to be marked first?? note: 2 values or 3 values as the smallest value has been selected to b4 vertices
does one always go from row to row to find the smallest unmarked value, or do you advance to the row that had the same marked value? Assume the smallest value in row A had been at column C, then AC and CA would have been marked. Would you go to row B next, or advance straight to row C? This logic seems to coincide with your example because once an edge was marked with vertex D, you stopped, instead of repeating the procedure to find smallest unmarked value in row D. Please clarify.
+aditya patnaik no you don't have to worship me. i am just making videos... thanks for the comment and thanks for watching :-) hope you find my other videos helpful goo.gl/Z89n9o
hey Yusuf,One single question and please reply asap. When you say that, "now find the smallest value in row-A, row-B and row-C while visiting the third row i:e Row-C" what actually does this means?? Do I have to get the value smaller in all these row(A,B,C)?? Even when'm visiting the third row and the smaller is present in the first row, then i have to choose the value of first row? And if this is so then what will be the next visiting row? Row-C or Row-D ? Please reply asap as my paper is ahead..and i came to ask this question when i was trying some big (9*9 table) tree to find MST using Prims Algo. thank you.
So Bruce Wayne, you mean to say that, If I've a table of 9*9 and m visting 7th row, then I do have to find the smallest of all the previously visited row having unmarked value? Is this what you mean?
@Bruce Wayne, Thanks man. I really appreciate your concern towards me. Soon I will be solving that problem again and will be back here if get any problem further..
@@sayak obviously can't provide an example here. But i tried using this method on a graph with 7 nodes and it didn't work. A cycle formed which should not happen.
question: when checking A row , smallest number was 5. when checking A row and B row, smallest number was 4 and when checking A row, B row, and C row, smallest number was 5?? how? if we have to check for common smallest number, then while checking A row and B row, minimum number should have been 5
in the case of A -- > D my prof worked like A --> B --> D and gave it a number instead of denoting infinity, my prim's algorithm is wrong according to your explanation. can you explain that? he says A is connected to D via B.
Hello Fawad N, Well yes, A is definitely connected with D via vertex B, and it is also connected via C, but the algorithm in this video says that we need to consider only those vertices that are directly connected by an edge. And in the graph (show in the video) we can see that there is no edge that connects A and D directly, that's why I inserted infinity in the table. And yes, Prim's algorithm is for minimum spanning tree which tells us that the final result will have the least(minimum) weight. Now if we consider A-->B-->D then the weight of the two edges combined will be 16 (please refer video for detail) which is higher than the correct weight and will automatically get discarded in the final stage. Similarly, if we consider A-->C-->D then the weight is 15, again not the least and will get rejected.
+Debarghya Sarkar The algorithm can't form a circuit because you only follow edges to vertices that haven't been added already. You can't reach the same vertex twice either directly or indirectly.
No unnecessary voice overs, no dryness, no commentary. You, Sir, are doing God's work. Thank You.
Thank you very much for making this video. A lot of websites have wrong explanation of this Algorithm. I came to your video after wasting my time over there .Now I have your channel for all my remaining doubts.
You proved this phrase " silence is better than noise", your videos are helping me a lot,Thank you!
if you really wanna thank this guy, watch the complete pre vid ad and click every ad pop up. this will support his efforts beautifully
The Autumn Bench Studio thanks for watching and appreciating my work :-)
It will be very simple and easy to learn if people will start teaching like this. Awesome way of teaching . Thanks a lot
Dear Yusuf,
Thank you from the bottom of my heart for making such great videos. I had my exam today and bumped into your channel last night. Checked 5 of your videos and that helped me a lot today. You have made my day. Thank you once again!
welcome :-)
more tutorial videos coming next year.
You don't speak but the presentation is far way better than speaking. Awesome presentation. First ever video seen on youtube that explains concepts without speaking and that too step by step. Thank you.
Yusuf, you are a saviour. your videos have helped me on numerous occasions. Thanks.
thanks mate, i was studying for my data structure exam and feeling so depressed, but i now feel better after i saw "stay happy and keep smiling". Thanks for your encouraging ^^
Another fabulous and easy solution to tough algorithm!!!!!! You are true genius Yusuf!!!!!!!!
+Ganesh Bedekar thanks for watching :-)
why not our colleges have best teacher like u ...marvellous explanation.
thank u so much for this beautiful content
It's really nice! Mathematics Dircrete is my most difficult subject. But.. only watch this video, it look so easy. Thanks u very much. You saved my life in university
JazakAllah Sir
Allah aap ko dil ka sakoon ata kare or asaanya paida kare(Ameen)
thank you guys for helping this video reach 100K views. you guys are awesome.
check out my other videos that i am uploading on sundays at 10am.
see you in the next video.
stay happy and keep smiling :-)
You can give a little code template for this algorithm, please.
why do you prefer to write explanations rather than talking? Such a silence made me feel a bit bored.
Yusuf Shakeel nys bro
Yusuf Shakeel the tutorial was very helpful.
If you have lots of edges - would it not make drawing a table much more complex.
Man, you are great! :) Before I start to read I just watch you video and create some picture in my mind. Then it helps to understand algorithm during reading materials, thank you so much!
+Turxan Badalov thanks for the appreciation. each morning i check comments and the love and appreciation i receive encourages me to make more interesting videos.
thanks again for watching and commenting :-)
You didn't say a word and explain everything which is very understandable. I learn it :) Thank you very much :)
was a very nice video sir.No complexities. Straight to the point.........well appreciable..
Thanks man, you make these concepts so easy to understand, I always come to your channel when I'm studying for Uni tests
+Matheus Seabra thanks. please share it with your friends if my videos are helpful :-)
i watch your tutorial first time than i think there is no voice than how it is understandable but when i complete this tutorial its Ausome bro very nice
Assalamu Alaikum (varah..) sir...your explanation was Excellent that is used to presented my seminar clearly.. continue this process to other maths papers thank you
Thanks mate. My confusions are now all gone thanks to your video .. :D
Thank uuu soooooo much its sooo helpful nd ur way to explain without voice its amazing
Very simple, clear and easy to understand. Thank You.
Apke videos bahut acche hain...thnx for all the videos ...👍👍👍👍👍
simple and clear tutorial ,that's what i was looking for. Good Work buddy!!
hi I definitely liked the simplicity of your teaching
keep up the good work !! :D
Seriously, it helped me in end time and gave me a strong insight. Thanks !
Excellent video, this really help me understand my class
thank you sir i took from your channel. thanks a lot. your teaching way is quite impressive. while without audio............
Brilliant video! Demystified Prim's Algorithm so much. Immense thanks!!!
thanks to you tomorrow is my final exam now your video is helping me much .....
Great tutorial. Helped a lot with my homework.
+Myles Chatman thanks for commenting :-)
This was one topic I avoided! Never knew it was so simple! Thank you Yusuf! Helped a lot at the last time! *sob* :')
consider a 5*5 matrix , if we got 2 same values in when finding smallest value in 1st two rows , or 3 values when considered 1st three rows . then what edge is to be marked first??
note: 2 values or 3 values as the smallest value has been selected to b4 vertices
Awesome work!!! Yeah there is no sound in your videos, but by the way its good to understand well in the silence, keep adding more...
+deepak dodeja thanks for watching :-)
Hey Yusuf. Really good and very easily understandable videos.
Waiting for the other videos on algorithm.
Thank you for the video, helped a lot.
Just an advice that you should've spoken throughout the video.
amazing ...itss soo easy .. nice style of teaching....
Thanks for the helpful tutorial! It was right to the point and easy to understand. I love the positive comments as well! :)
+kathryn harris thanks
it's better than my teacher's explaination. thx man
+Eliyahou Zagabe thanks for watching :-)
Thank a lot for this video!! I missed a class on this lesson and this video really helps!!
how you make such video..which software ?
also want to know
does one always go from row to row to find the smallest unmarked value, or do you advance to the row that had the same marked value? Assume the smallest value in row A had been at column C, then AC and CA would have been marked. Would you go to row B next, or advance straight to row C? This logic seems to coincide with your example because once an edge was marked with vertex D, you stopped, instead of repeating the procedure to find smallest unmarked value in row D. Please clarify.
Nice video!!! I was having trouble finding decent content of this subject. Thank you!
Excellent teaching skill you have had ,Thank you,Buddy.
Thanks a lot :) you've saved my grade
adit ghosh thanks for watching :-)
Yusuf bhai ur videos are simply awsome . :')
+mujtaba khalid thanks
dude!..your tutorials are pretty awesome!!.
dude let me worship you............these are the easiest explanations I've seen.
+aditya patnaik no you don't have to worship me. i am just making videos...
thanks for the comment and thanks for watching :-)
hope you find my other videos helpful
goo.gl/Z89n9o
Dear Yusuf ,
can you share us the PPt slides that you are using?
Amazing.... explanation thanks for sharing your knowledge🙂
and what if there is smallest edge making circuit , will we reject that edge and also mark that in table. please guide!
why we are taking infinity from A to D ?
no direct link
Thank you a lot. Best tutorial on this algorithm
Rahma Sallam thanks for watching :-)
your tutorials are awesome....helps a lot thanks
Clear and concise explanation, thank you :)
you saved my 10 marks in the exam I'm to attend in 4 hours.
+Shin Akuma thanks for watching
thanks again sir. and sir i want to DAA other lecture also like greedy algo, pseudo code, NP hard, multistage graph etc. can you provide us ?
Baya please rply my question the edge weight values are taken random or any special case.
Very Precised and Useful. Helped a lot! Thankyou :)
+Sakshi Boolchandani thanks for watching and commenting :-)
Why there is no sound in your vids?
Massoud Massoudi thanks for watchingi will add sound in my future videos.
Excellent Yusuf.. keep it up with good work and stay blessed :)
IF there are two same numbers in A-row,what should I do? Sorry about my poor English....
+dy l you just choose any of them, doesn't matter. There can be more than 1 MST in a graph.
Total weight should be the same in the end.
Exactly you can choose any of the one doesn't matter...
hey Yusuf,One single question and please reply asap.
When you say that, "now find the smallest value in row-A, row-B and row-C while visiting the third row i:e Row-C" what actually does this means?? Do I have to get the value smaller in all these row(A,B,C)?? Even when'm visiting the third row and the smaller is present in the first row, then i have to choose the value of first row? And if this is so then what will be the next visiting row? Row-C or Row-D ?
Please reply asap as my paper is ahead..and i came to ask this question when i was trying some big (9*9 table) tree to find MST using Prims Algo.
thank you.
Pratik Lalan He said unmarked
from first two rows 4 and 5 were marked
So Bruce Wayne, you mean to say that, If I've a table of 9*9 and m visting 7th row, then I do have to find the smallest of all the previously visited row having unmarked value? Is this what you mean?
Pratik Lalan there will be 6 values which will be marked
Apart from those choose smallest among all the rows
@Bruce Wayne, Thanks man. I really appreciate your concern towards me. Soon I will be solving that problem again and will be back here if get any problem further..
may be the best explaination for prims algol... nicee
Thanks Yusuf, it was quite straightforward. :)
Very simple and easy tutorial
Thanks a lot 😉👍
hey buddy, do u have videos of graphs ?
Good work buddy you taught well
Well done !
you make it so easy to understand.
thanks.
welcome :-)
Thanks. It is clear and easy to follow,
Can you do a tutorial of a circular linked representation of the polynomials? Thank you in advance
this doesnt work at all times. not with more complex trees
can you provide examples to justify please?
@@sayak obviously can't provide an example here. But i tried using this method on a graph with 7 nodes and it didn't work. A cycle formed which should not happen.
@@rct3vids99 ok thanks if u can post a link to that question I could see it
This a greedy algorithm that chooses simplicity over accuracy. It tends to be inaccurate sometimes.
@@sayak please check a graph at site geeks for geeks.For that it doesn't work may be i'm wrong but check it
what if two rows have same value which one to select?
question: when checking A row , smallest number was 5. when checking A row and B row, smallest number was 4 and when checking A row, B row, and C row, smallest number was 5?? how? if we have to check for common smallest number, then while checking A row and B row, minimum number should have been 5
+Anubhav Koul Smallest unmarked (non-ticked) edge
Simple & powerful! excellent job!
very very very good presentation bosss👍👍👍👍👍👍☺☺☺👌👌👌👌
in the case of A -- > D
my prof worked like A --> B --> D and gave it a number instead of denoting infinity, my prim's algorithm is wrong according to your explanation.
can you explain that?
he says A is connected to D via B.
Hello Fawad N,
Well yes, A is definitely connected with D via vertex B, and it is also connected via C, but the algorithm in this video says that we need to consider only those vertices that are directly connected by an edge. And in the graph (show in the video) we can see that there is no edge that connects A and D directly, that's why I inserted infinity in the table.
And yes, Prim's algorithm is for minimum spanning tree which tells us that the final result will have the least(minimum) weight.
Now if we consider A-->B-->D then the weight of the two edges combined will be 16 (please refer video for detail) which is higher than the correct weight and will automatically get discarded in the final stage. Similarly, if we consider A-->C-->D then the weight is 15, again not the least and will get rejected.
(Y)
bhai jan ap kis city sa hen
Short and Simple!! Nice Video.
happy new year
stay happy and keep smiling :-)
#happynewyear #stayhappyandkeepsmiling #yusufshakeel
Yusuf Shakeel please sir in the end write a small algo too.
thks for the tutorial .simple and easy !
By which slideshow or software do you use to create this??
sir.... can you explain some on tree in graph theory
Really good video.
Would be a lot better if there was an audio with it.
+Rishabh Soni thanks for watching :-)
you are amazing ... thanks a lot .. I hope from god to keep you from any dangerous
+حسن اسماعيل thanks for watching :-)
Damn, thanks a ton man! For this and for Kruskal's algorithm too!
thank you very much for this great teaching
Please make a tutorial video on AVL trees !
I think this is very best for lern prim's algorith.......
thanks again, there is no words, is awesome
Mr.Shakeel, please give us one on Kruscals algorithm.
hope this helps
ruclips.net/video/5XkK88VEILk/видео.html
Really Nice Video..Keep Rolling Out
It will be really helpful if you provide a link for the code.
www.dyclassroom.com/graph/prim-algorithm-finding-minimum-spanning-tree
thank you it's explain amazing briefly but useful
Very useful.Helped a lot .........Thank you!!
+Nandan Arumugam welcome :-)
WHAT HAPPENS WHEN THE IT FORM A CIRCUIT ?
+Debarghya Sarkar The algorithm can't form a circuit because you only follow edges to vertices that haven't been added already. You can't reach the same vertex twice either directly or indirectly.
kreativitetNO thanks a lot .i understood.
Thank you very nice explanation!.
Super ra thammudu complete verey
Thanks yusuf, helped a lot❤
The concept would be more clear to grasp if the edge A-C has weight 4.
Anyways, thanks for a quick revision of the topic :)