Graph Theory: Kruskal's Algorithm

[@asataala9477]

4 hours of lectures explained in 2 x 5 mins vids from you. thank you

[@whatever-qx9wx]

Watched this and the other Spanning Tree video in preparation for discussing them today in discrete math! Thanks for the fast and easy examples :D

[@Bruhmmist]

Useful tip to understand this better: Take the amount of vertices on the graph (example: 6). Subtract 1 (6 - 1 = 5). The resulting number is the amount of edges you will add to your minimum spanning tree before you know you are done (5 edges).

[@Djulio]

Thanks for those really helpful videos. I wish our professor could explain it like that. :D

[@devendra.sanghavi]

Seen 4 other videos. Atlast i had to come here, and understood it here

[@sitinorani4519]

how can we know the spanning tree is done?Why not continue to next smallest cost?

[@ThuyNguyen-bu9ge]

Hi, thank you for the lesson. In what math course is Kruskal's Algorithm taught?

[@Yasory]

+Tiffastic Nguyen Generally this is part of Graph theory which is mostly thought in Computer Science

[@devendra.sanghavi]

Discrete Maths or even Data structure algorithms

[@memofahood4543]

It is really helpful. Thank you

[@Mathispower4u]

That is great to hear. Thanks for the comment.

[@AliJoohy]

it is man, it is.. Thank you a lot

[@monikamunjal11]

good job,, keep uploading more videos :)

[@loginid7108]

mundal hain mundal xD

[@christinehort5938]

Need help can anyone help me

[@hdjksa52]

Thanks a lot

[@ShubhamGupta-ow3ws]

gracias..

[@1gouravgg]

the problem with living life in the fast lane is that you get to the end in an awful hurry.