This is the most clear explanation I've seen. It contemplates everything, Thank you!!

@EducateYourselfNow

6 жыл бұрын

thank you so much!

@jacoblopez6365

3 жыл бұрын

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.

@Xeerxes

Жыл бұрын

@@jacoblopez6365 was pretty clear to me to be honest

awesome video man, was struggling at first to get the concept and you helped nail it down for me. thank you!

saved me during finals man absolute stud

Thank you so much. I was baffled with so many videos.But yours tutorial took my concepts on the track.

@EducateYourselfNow

6 жыл бұрын

thank you very much! i am glad my videos are helpful

This is the most clear explanation I've seen. Thank you so so so much

Your video helps me a lot. Thank you for your great work!

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.

@MyBajskorven123

3 жыл бұрын

thank you, just finished coding and my algorithm chooses a-h first

This totally helped me, you're explanation is clearer. Thank you!

Great explanation! Much better than my book and I finally understand it

Thanks a lot ....after a lot of search I got this helpful explanation.

Nice explanation in a short amount of time..!!Keep it up!!!Thank you so much :)

Brilliant! Thank you for your clear explanation.

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.

@EducateYourselfNow

6 жыл бұрын

that is true, i should have. Maybe i ll upload another one

Thank you very much! Greetings from Italy!

Thanks a million Sir 👍👌🔥 4 years before but hasn't lost the charm 👍

Genuinely clear explanation. Thank you!

best explanation for prims algo that I've found

Made me understand it in minutes!! Thank you!

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

@EducateYourselfNow

5 жыл бұрын

i am glad i could help, thank you for the comment!

Thank you for explaining this in a simple and efficient way! (This lesson was even better than my tutor's LOL)

this is an excellent explanation. This will definitely help me for my data structures exam

@EducateYourselfNow

5 жыл бұрын

thank you and good luck

Simple and easy. Great job dude!

@EducateYourselfNow

4 жыл бұрын

thank you

mannn .. that was so simple. Really helped me a lot.

Great explanation! Not the best video/audio quality, but definitely way better than most videos about this topic

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

@EducateYourselfNow

6 жыл бұрын

i am glad i can help :) thank you so much for the sub!

@kimayapanash8998

6 жыл бұрын

love you from the bottom of my heart. now i can make all my friends beg me to help them HAHAHAHAHA

@EducateYourselfNow

6 жыл бұрын

lol unless they see this video

Thanks so much! this is such a great video!

Wonderful explanation. Thank you!

6 years later and it still helps students like me

No wonder they say it's a surprisingly easy algorithm! And yet quite difficult to teach for some

Woah i was making a table but this is really easy the way you have done thanks alot.

Thanks, you confirmed that my professor messed up in grading our homework, thanks

@EducateYourselfNow

7 жыл бұрын

Get as many points as possible, they add up at the end.

This is a great video. Thank you so much! God bless :)

You are such a dope bro,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

this was so clear like you explained it better

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!

Great explanation, thanks!

Nice Work man :)

Cool explanation

Thanks for this video brother👍

A perfect explanation. Thanks :)

@EducateYourselfNow

6 жыл бұрын

thank you :)

You make it simple thank you

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!

@EducateYourselfNow

4 жыл бұрын

Thank you very much!

Keep up the good work buddy!

@EducateYourselfNow

5 жыл бұрын

thanks you my guy!

nice explanation. Thanks for sharing!!!!

Super helpful thanks man.

wow using this video i understood it completely

great example video

bless you, sir

Really helpful thanks!

Thanku for uploading this video because this is usefull for student like me.

I never comment on any video on youtube :-) but seriously u deserve a BINGO ..... THANK YOU

@EducateYourselfNow

5 жыл бұрын

thank you!

Well done - the part about no cycles are not emphasized in other videos.

Thank you so much!

That's a lot simpler way than it's taught in CS! Love it!

nice work.thank you so much.it has another alternative solution no?

Watching your video Once again To revise topic one day before my End term❤️✔️ Thanku for lovely video

@EducateYourselfNow

3 жыл бұрын

Hope you did great :)

@VARUN-gn5kq

3 жыл бұрын

@@EducateYourselfNow yes sir!! But actually this topic which i prepared for did nt come in exam!!

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?

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.

thanks a lot man!!!

Plz tell me the calculating time of prims algorithm which is implemented using SPQ (it is a special kind of priority queue)

Thanks my hero

thanks my dude

Thanks a Lots.... It's help me to understand this topic.....

@EducateYourselfNow

6 жыл бұрын

I am glad i was able to help :)

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?

Thanks a lot!

Thanks. Total is 37

Perfect! Thanks

thank you so muchhh!!!

0:57s does arbitary vertex in the sense means any vertex of my choice ?

@noahtownsend3962

5 жыл бұрын

That is correct

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.

@EducateYourselfNow

5 жыл бұрын

yeah you are right, i missed that.

Its help me so much..thank you.. Btw, ur voice sound a little bit like harry style..

Very Useful😆

+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?

How it will help us to find a shortest path????...

best explanation XD

thank you!

i need kruskal with prims and dikistras in single progragramm .. any help ???

Great explanation than my lecturer

At 5:46 how would edge 11 create a cycle?

Thanks!

Thanks! This is very helpful

thanks bro..it is helpful

@EducateYourselfNow

6 жыл бұрын

thank you very much!

what will be cost of this graph??

Do we determine a node to start? Or we just start?

@EducateYourselfNow

5 жыл бұрын

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.

What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?

@zoriiginalx7544

6 ай бұрын

MST of the graph is a regular MST as well.

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 ?

@EducateYourselfNow

4 жыл бұрын

because we were at the node "c", and least costly edge from "c" is to "i"

Thanks sir🤗

but what if we selected the edge from a-->h instead of b-->c? And is it necessary that we do get the exact spanning tree when we select any vertex?

@EducateYourselfNow

5 жыл бұрын

you would just continue the process, and what do you mean by that question?

Thanks :)

thank you

TY m8 :))))

my code chooses a-h instead of b-c, is this wrong or ???

Very well❤

@EducateYourselfNow

4 жыл бұрын

thank you

bravoo...!!!

Nice

Great 😍

Ty

I have a question, why would i not be able to simply look at every node and assume that the cheapest path for that node was one that would be a part of the minimum spanning tree?

@EducateYourselfNow

6 жыл бұрын

I am not sure if i understand the question properly

@welfarewagonrepairs

6 жыл бұрын

Thank you for the timely response, my goal isnt to find a minimum spanning tree but instead find the sum of the value of all paths that must be taken. so i was wondering if i could instead look at each node in the input independently and simply take the cheapest path for each node?

@EducateYourselfNow

6 жыл бұрын

I see, yes you should be able to achieve that by looking at the input independently and taking the cheapest edge cost to its neighbor.

Thx bro