I thought I had my answer at about :20 into the video But I wanted to make sure so I watched until about 1:30 and my answer was confirmed About 1:30 plus the 2 minutes searching google to find your video or "read" 40 pages of death to maybe find the same conclusion I'll pick the 2 and a half minutes with you every time! thanks for this awesome video that cut the BS and got straight to business - no frills no BS new subscriber!
So is it safe to say, that this video finds the shortest solution one could travel to get to all locations? Meaning that every node must be reachable, but it's the most effecient way to reach all nodes? I'm strugling with this a bit because you could take the road from A to H and get there much faster that going way around.
Does it mean that we have to stop selecting edges until most edges that do not form a cycle will be selected? Then that would be the time the MST is already completed?
at 5:01, why didn't you consider g to i because cost is 6 which is less than 7? i know it will create a loop but you did not even mention it? is there a reason or you just overlooked it by mistake ? thank you
at 4:44 "number 7 seems to be the lowest out of all of them. pay attention we can't choose this as it will create a cycle and we can't have a cycle in prim's algorithm."
One must cover all the vertices on the graph using smallest unit to get there, the reason why i didn't choose f to e instead of d to e is because f to e has a higher cost to get to e than d to e since from d to e costs 9 and f to e costs 10.
EducateYourself I want to application of the minimum wight rooted arborescence problem and i want to write an algorithm for minimum wight rooted arborescence problem in acyclic digraphs How to write.
How would you do it if you can’t backtrack? You went from C to I and the C to F. If you had to continue from the last point you reached, how would you make it efficient?
I HONESTLY SPEND AN ENTIRE DAY LOOKING FOR A GOOD SOLUTION TO PRIMS AND I AM SO HAPPY I FOUND IT. THANK YOU SO MUCH FOR THIS . YOU GOT A NEW SUBSCRIBER
I have a question b-c and a-h are basically ties because their distances are the same so why after choosing a-c did we not choose a-h ? But rather chose c-i ?
at 5:17 we can not select AH not only because it would create a cycle but because A and H are already discovered before...so there is no need in examining those 2 edges at that moment Great explanation though!! clear and to the point!!! love your videos on Kruskal's and Dijkstra as well!! :D
![[🔴LIVE] งานประกาศรางวัล MAYA TV AWARDS 2024 : มายามหาชน](http://i.ytimg.com/vi/nwmWYXXVwBY/mqdefault.jpg)
This is the most clear explanation I've seen. It contemplates everything, Thank you!!
thank you so much!
I wish I could agree, but there was not explanation why we must consider all the edges that he rattled off after getting to a node.
@@jacoblopez6365 was pretty clear to me to be honest
saved me during finals man absolute stud
You really should explain this using a queue as this is really the back bone behind this algorithm and is an easy way to show how to choose a path.
that is true, i should have. Maybe i ll upload another one
Thank you so much. I was baffled with so many videos.But yours tutorial took my concepts on the track.
thank you very much! i am glad my videos are helpful
I thought I had my answer at about :20 into the video
But I wanted to make sure so I watched until about 1:30 and my answer was confirmed
About 1:30 plus the 2 minutes searching google to find your video or "read" 40 pages of death to maybe find the same conclusion
I'll pick the 2 and a half minutes with you every time! thanks for this awesome video that cut the BS and got straight to business - no frills no BS new subscriber!
Thank you very much!
Note: the spanning tree is not unique. Removal of edge (b,c) and replacing it with (a,h) gives a spanning tree with the same total distance.
thank you, just finished coding and my algorithm chooses a-h first
Your video helps me a lot. Thank you for your great work!
this is an excellent explanation. This will definitely help me for my data structures exam
thank you and good luck
No wonder they say it's a surprisingly easy algorithm! And yet quite difficult to teach for some
This totally helped me, you're explanation is clearer. Thank you!
Made me understand it in minutes!! Thank you!
6 years later and it still helps students like me
Watching your video Once again To revise topic one day before my End term❤️✔️
Thanku for lovely video
Hope you did great :)
@@EducateYourselfNow yes sir!! But actually this topic which i prepared for did nt come in exam!!
You are such a dope bro,Thank you!
Well done - the part about no cycles are not emphasized in other videos.
Woah i was making a table but this is really easy the way you have done thanks alot.
Thank you so much!
Thanku for uploading this video because this is usefull for student like me.
A perfect explanation. Thanks :)
thank you :)
Cool explanation
nice work.thank you so much.it has another alternative solution no?
0:57s does arbitary vertex in the sense means any vertex of my choice ?
That is correct
What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?
MST of the graph is a regular MST as well.
So is it safe to say, that this video finds the shortest solution one could travel to get to all locations? Meaning that every node must be reachable, but it's the most effecient way to reach all nodes? I'm strugling with this a bit because you could take the road from A to H and get there much faster that going way around.
Does it mean that we have to stop selecting edges until most edges that do not form a cycle will be selected? Then that would be the time the MST is already completed?
That's a lot simpler way than it's taught in CS! Love it!
Its help me so much..thank you..
Btw, ur voice sound a little bit like harry style..
Really helpful thanks!
nice explanation. Thanks for sharing!!!!
Perfect! Thanks
You make it simple thank you
i dont understand, why should we take c-d that cost 17, when e-f cost 10 and doesnt cause any loop
Its a 7, not 17.
How it will help us to find a shortest path????...
Thanks my hero
At 5:46 how would edge 11 create a cycle?
Thanks. Total is 37
at 5:01, why didn't you consider g to i because cost is 6 which is less than 7? i know it will create a loop but you did not even mention it? is there a reason or you just overlooked it by mistake ? thank you
good catch, yes I forgot to mention that 6 is the lowest but it will create a loop and that is the reason why I didn't choose it.
at 4:44 "number 7 seems to be the lowest out of all of them. pay attention we can't choose this as it will create a cycle and we can't have a cycle in prim's algorithm."
Because you keep track of previously visited vertices. At this point, I and G are already visited.
Thanks sir🤗
thank you so muchhh!!!
Thanks!
Thanks a lot!
best explanation XD
Color the visited nodes or manage list to detect cycle !!!
Dont take edge with 2 visited nodes...
Good
what will be cost of this graph??
Nice
thanks bro..it is helpful
thank you very much!
thanks a lot man!!!
TY m8 :))))
Great 😍
thank you
why u dont choose f to e ?
One must cover all the vertices on the graph using smallest unit to get there, the reason why i didn't choose f to e instead of d to e is because f to e has a higher cost to get to e than d to e since from d to e costs 9 and f to e costs 10.
in simplest terms, you are just picking out smallest distances between two vertices without creating a cycle
thanks
cost is high
can i get the code for this?
Code for Prim's Algorithm?
cheers lad
You are wrong in prim's we select least cost vertex
So we select h to g vertex instead of a to b
POST MORE VIDEOS
You open by saying Prim is the same as Kruskal. This is NOT true. Please be precise.
gud 1
Do you have Facebook or twitter ? I have question in math
Unfortunately I don't, but feel free to message me directly on TH-cam.
EducateYourself I sent you but I don’t know you read it or no .
Just saw the message
EducateYourself I want to application of the minimum wight rooted arborescence problem and i want to write an algorithm for minimum wight rooted arborescence problem in acyclic digraphs How to write.
EE241C5A ftw!!!
Finally a non-indian version, sick of these videos by indian guys with their accents
Everything is clear except the writing
MST is not similar to dijkstra it is used to find cost of min spanning tree...not shortest path
awesome video man, was struggling at first to get the concept and you helped nail it down for me. thank you!
Thanks, you confirmed that my professor messed up in grading our homework, thanks
Get as many points as possible, they add up at the end.
Great explanation! Much better than my book and I finally understand it
How would you do it if you can’t backtrack? You went from C to I and the C to F. If you had to continue from the last point you reached, how would you make it efficient?
Thanks a lot ....after a lot of search I got this helpful explanation.
Brilliant! Thank you for your clear explanation.
For the last move as you said we have choice between 9, 10 and 11 I think choosing the edge b-h was not a choice. it would have been a cycle.
yeah you are right, i missed that.
this was so clear like you explained it better
I never comment on any video on youtube :-) but seriously u deserve a BINGO ..... THANK YOU
thank you!
This is the most clear explanation I've seen. Thank you so so so much
mannn .. that was so simple. Really helped me a lot.
Simple and easy. Great job dude!
thank you
This is a great video. Thank you so much! God bless :)
Thanks so much! this is such a great video!
Ur the best other just use a small path so it makes this algorithm unclear but u use long path to show this. GOOD WORK!
Thank you very much! Greetings from Italy!
I HONESTLY SPEND AN ENTIRE DAY LOOKING FOR A GOOD SOLUTION TO PRIMS AND I AM SO HAPPY I FOUND IT. THANK YOU SO MUCH FOR THIS . YOU GOT A NEW SUBSCRIBER
i am glad i can help :) thank you so much for the sub!
love you from the bottom of my heart. now i can make all my friends beg me to help them HAHAHAHAHA
lol unless they see this video
Thanks a million Sir 👍👌🔥
4 years before but hasn't lost the charm 👍
i still dont understand my lecturer give me question to find the shortet path from A to J
Nice explanation in a short amount of time..!!Keep it up!!!Thank you so much :)
Nice Work man :)
best explanation for prims algo that I've found
I have a question b-c and a-h are basically ties because their distances are the same so why after choosing a-c did we not choose a-h ? But rather chose c-i ?
because we were at the node "c", and least costly edge from "c" is to "i"
wow using this video i understood it completely
I have a Decision Sciences exam on Monday (today being Saturday 1am) and you helped me cover 20% of a section in 6 minutes. Thank you kind sir
i am glad i could help, thank you for the comment!
Wonderful explanation. Thank you!
at 5:17 we can not select AH not only because it would create a cycle but because A and H are already discovered before...so there is no need in examining those 2 edges at that moment
Great explanation though!! clear and to the point!!! love your videos on Kruskal's and Dijkstra as well!! :D
bless you, sir
Great explanation than my lecturer
Do we determine a node to start? Or we just start?
you can start on any node which will still give you the same minimal possible weight st, however, it may result in a different mst.
my code chooses a-h instead of b-c, is this wrong or ???
You save my day man. Thanks... 🤩
Thanks :)
This man sounds like Nico Rosberg lol
Very Useful😆
Thanks for this video brother👍
+I don't understand. The route a h g f e has a spanning tree of 21, which seems the shortest to me. So the algorithm doesn't really work?