Use Kruskal's Algorithm to find Minimum Spanning Trees in Graph Theory

Are you an @MzMath Fan?! Please Like and Subscribe. :-)
And now you can BECOME A MEMBER of the Ms. Hearn Mathematics Channel to get perks!
/ @mzmath
In this video: Spanning tree, weighted graph, and minimum spanning tree are defined with examples. The steps for Kruskal's algorithm to find a minimum spanning tree for a given graph are listed. Examples of how to use Kruskal's algorithm are explained, including one in which it turns out there are multiple minimum spanning trees possible.

[@luisfernandomanzano9953]

It's puzzling how she explained in 9 minutes what my college professor failed to do in 90.

[@MzMath]

Glad you liked it! 😋

[@buzztrucker]

Agreed.

[@redbakery8943]

Thank you, visualising it step by step was very helpful

[@MzMath]

I am so glad to hear it!

[@TheRobotSpirit]

Amazing! Finally a simple and easy to understand explanation. You've really helped me on my finals. Thanks so much!

[@MzMath]

So happy to hear it was helpful! You are very welcome!

[@deemckay7661]

Fantastic video. Thank you for making it easy to understand.

[@MzMath]

You're very welcome!

[@luisdavidliceatorres7688]

The video was very helpful, thanks.

[@MzMath]

So happy to hear it!

[@Yashila_Jonnada]

Thank you very much! Beautiful Explanation!

[@MzMath]

I am so happy you think so!

[@sumiyatamannur423]

Thank you so much!!! It was great!!

[@MzMath]

Glad you liked it! 😊👍

[@RanbirSingh-zc2du]

very nice explanation!

[@MzMath]

Glad you liked it!

[@sarapakhtoon5441]

AHHHH THANK YOU SO MUCH!

[@MzMath]

You are welcome! 😁