Kruskal's Algorithm: Minimum Spanning Tree (MST)

Example of Kruskal's algorithm

[countchungalitus]

Studying for my data structures exam that is in... four hours. Your videos on Kruskals, Prims, and Dijkstra's are saving my life because I missed those lectures. Cheers mate!

[monaami]

"the main thing is, you can't have any psychos" - agree!

[Alkis]

One improvement I would make would be this: When choosing between two edges with the same weight, choose randomly between them, but give a probability weighted by the degree of the node you are connecting to. In many real life networks, nodes with high degree tend to receive more new nodes than less connected nodes.

[MuhidAbidpoint]

Again, short and simple to the point great video.

[dedel]

I thought it was my laptop's fan that sounds so loud when i listened to the audio. I panicked for a sec. But thanks! This really helped a lot!

[jacopomaccari]

bro just increase the thickness of the pen 😂😂

[gongjiaji]

thank you very much, i have exam tomorrow

[sirch]

Thanks for helping me with my hw, you rock my dude

[orangutan]

if you also circle the vertices you've visited red, choosing the next edge/vertex pair will become easier without having to look through the entire graph to check for a cycle

[unknownplayer]

dope thanks for this video. you just did 10 times better than my professor at cal state Monterey Bay

[monilparekh]

1. how does adding edge (b, h) with edge weight 11 form a cycle?
2. adding (c, i) and (g, f) with edge weight 2 is fine but adding (b, c) and (a, h) with edge weight 8 is a problem.
can you elaborate?

[sanjeewankulathunga]

i have exam tomorrow thanks man i got it

[zepheriah]

You said that since you decided to pick the edge with amount 8 from B - C, you couldn't pick the edge amount with 8 also from A - H because it wasn't a part of the same tree. Why is that? I thought all of the vertices were in one tree? What is the criteria on that?

[amiraayedi]

Thank you for this!! (you have a nice voice though god)

[nooranalkhateeb]

the path you choose is not the shortest path

[caparn]

How do you programmatically test if adding the edge will form a cycle?

[Github_tech_with_ty]

Can someone explain what he mains by cycle more?

[bennybob]

Given completely distinct edges in graph G, there is only a single MST.

[sirisunkam]

U r explanation too gud...pls explain bellmanford algorithm also....

[azzahrahumaira]

if we have touched all the vertices but not all the edges yet what should i do? finish all the edges?