Kruskal's Algorithm (Decision Maths 1)

[@liutenghou]

The clarity of this video is awesome. Thanks.

[@HEGARTYMATHS]

Correct node and vertex mean the same thing. Arc and edge mean the same thing. You can use either term interchangeably. Mr H

[@HEGARTYMATHS]

You're very kind! Delighted to have helped. Mr Hegarty

[@cybacyclonex2]

Thank you so much!!! You must be the best teacher... I never truly had!

[@panagiotisgiaples7520]

Thank you Mr. Hegarty , this video was very helpfull , now i think i can pass my exams

[@Chung94]

LIKE your explanation , I watched this one time , then I fully unterstand it .
So exciting .
Thank you very much !!!

[@evilraider13]

Thankyou so much for this explanation, one of the best ive seen. You have really helped me a lot. cheers

[@HEGARTYMATHS]

You're very welcome. Best of luck in that paper! Mr H

[@adiy77]

algorithm + example= understanding. Thanks for this tutorial. You are doing a great job. :)

[@HEGARTYMATHS]

You are welcome and check out my website hegartymaths.c.o.m. for loads more help and loads more vids. Best wishes. Mr H

[@HEGARTYMATHS]

You're very welcome Joao!

[@HEGARTYMATHS]

Glad to have helped! Did you do ok?

[@Photoholic0105]

You sir, are an absolute legend!

[@fallenangel871]

Great revision video, thanks! :D Got the exam this afternoon, so couldn't have found this at a much better time :)
Just wondering, have you done any videos that give a justification for Prim's or Kruskal's algorithms? I remember going over it once, but can't remember the details of how to prove they always give a MST. I know I don't need it for the exam, but...
Thanks again for a great video :D

[@arvram1151]

thank you very much,i want to know about bellman ford algorithm please explain

[@fredrik.larsen]

Any particular reason you are using the term "arc" instead of "edge"? Thanks

[@NER124]

Comp data structures final in 2 hours, thank you sir!

[@sibushree]

it was very easy after seeing ur ideo thanks for uploading

[@Bluekittyzz]

Great video, thank you very much.
Could you tell me what program are you using? I find it very practical.

[@mattieb98]

Smart notebook for mac

[@kzywzy167]

Do you not have to state the rejected arcs though?

[@HEGARTYMATHS]

You're very welcome

[@amizan8653]

You explained that perfectly, thank you!

[@TahirahAukloo]

So well explained:)
Thank you very much

[@nikhilkuttan1447]

thank you so much hlpd me alot ... tommorow m havng "analysis of algos" university ppr

[@rishabhkjha92]

thanks mr.Hegarty it was very helpful 4 me .... :D

[@MrSelvan87]

Thank u Mr.Hegarty:)

[@vijaykiran6889]

Kruskal Algorithm cant be explained better!!

[@jofalves]

Good lesson friend.

[@mohit16804]

haha true.. tomorrow is my exam on Graph theory.....! Needed to learn this :)

[@ThisWonderfulWorld]

i'm guessing arc => nodes and edge => vertices? they are more or less the same anyway XD

[@24zzlovebasketball]

Thank you So much!.Your the Best Sir :)!..

[@HEGARTYMATHS]

HI Eddy gonsalvez Thanks loads for the comment. Check out the website and in particular A-Level decision maths on the site for loads more help. Best wishes. Mr h www.hegartymaths.com/

[@0diepus]

thank you sir. great help.

[@jeviounipers]

thank you so much sir

[@snyyzc]

Thank you so much, it is aweso ,,,

[@erzascarlet2945]

Awesome Video!..:D Thanks a Lot..:)

[@TheNealtt]

nice video !!

[@KC-Shinobi]

So this isnt connect the dots...

[@loukasisal0ser50]

my fuckin guy mr h

[@mohit16804]

Thanks very much.....

It will be in 3.5 h

[@linkinms]

thanks sir!

[@spillow762]

Thank you

[@michalkoci3557]

Thank yoou

[@blablabla1000able]

You are a god.

[@GLS325]

very nice :))

[@surajitdutta101]

thanks this good

[@oddostudy5975]

easy explanation ... (y)

[@joelmiller92]

thx sir ":)

[@taboka0072]

im confused as how to 18 creates a cycle

[@AbhishekSarkarKelsnare]

2nd ans is 51

[@JaH0800]

Did your clothes dryer come on at 6:14?