How Do You Calculate a Minimum Spanning Tree?

A story based on Kruskal's Algorithm

***

[mahmoudalsayed]

Channel name checks out, I have never imagined I would say that in YouTube.
Really great explanation.

[aliyuumargumel]

Wow! Using real life example is the best teaching strategy.

Thank you very much.

[johetajava]

You are a very good teacher, thank you for the video!

[UnyimeUdoh-nylp]

This explanation is just too cool 😎😎😎😎

[granrey]

I would like to see a variance of this video adding removing snow on each house and man power on each not being necesarily the same and comencing from a particular house.

[ultragamer]

this is like when the main protagonist says the name of the movie

[qwarlockz]

This sounds so much like a variation of Dijkstra... am I wrong?

[Randy]

Wouldn't a way to ensure maximum efficiency be first to check if any nodes only have one edge and if so connect those edges first thefore removing that edge from any future comparisons and lowering the number of connections needed to reach n-1 nodes once you start the algorithm?

[aidendelgado]

fire vid keep posting, spanning tree!

[blacklight]

This guy is fr trying to convince me that 6<5

[diegoortega]

Excuse me broher, but I didn't get the cut property. If you take the 3-weight road and then the 6-weigth road, you will end up needing 19 volunteers rather than 18. But you mention that according to this property, you will end up still with a subset of a minimal spannin tree. Could you explain me further please?

[parheliaa]

The more interesting example would be when some non-direct roads are optimal, instead of point-to-point connections.

[EmergencyTemporalShift]

Wait, do the roads need to be cleared for people to travel to the blocked roads?

[slgnssp]

what if two edges have the same weight?

[darkfrei]

1. Connect a house to the other.
2. Take any two houses and connect them if one and only one has not connected.
3. Repeat 2.

[UnyimeUdoh-nylp]

This explanation is just too cool 😎😎😎😎