Kruskal's algorithm in 2 minutes

Step by step instructions showing how to run Kruskal's algorithm on a graph.
Code: github.com/msambol/dsa/blob/m... (different than video, I added this retroactively)
Source: Algorithms by S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani [www.amazon.com/Algorithms-San...]
LinkedIn: / michael-sambol

[@AnishKaranPhotography]

Are you from outer space? My lecturer couldn't explain this in 2 hours and you did in 2 mins. Thanks a lot.

[@peterbakke]

Math and CS educators need to work backward from this video. Have the students obtain an intuitive understanding of what's going on, and then drone on for 2 hours. Hopefully, something sticks. Way to go, Michael!

[@diwang4572]

@@Fedorahatter exactly, my professor talked about bunch of lemma and proofs first and then go on briefly touched upon the algorithm which we were all lost by the time he talked about it which was like 1 hour into the lecture.

[@mavyfaby]

Same, this video is much better than my lecturer explaining this topic in an hour still I didn't understand. I wish he'll explain like this.

[@adelalmohtaseb5261]

Fr me as well.

[@danielriley3618]

😆

[@Elmirgtr]

you explained something in 2 minutes what my prof did in two lessons.

[@MichaelSambol]

Elmir Ma Glad I could help!

[@Griff10poldi]

+Elmir Ma Same thing here.. I've wasted my time at class lol

[@Elmirgtr]

Griffin Seannery and I ended up doing well in that class. Thanks again, uploader!

[@school_pizza]

@@Elmirgtr Some stories have fairy tale endings.

[@Elmirgtr]

@@school_pizza So true. When I wrote this I was in undergrad, now I am doing PhD and working on a paper to submit to Nature

[@mohammedabdulrafay]

“If you can't explain it to a six year old, you don't understand it yourself.”

[@R1CARD049]

Thank you so much, we were given incomprehensible pseudo-code and confusing notation. For this to seem so simple after a

[@MichaelSambol]

+Richard Paul You're welcome, Richard. Glad you enjoyed.

[@08a14979]

i hate discrete math with passion. making something simple look so complicated

[@biblemansings]

@@08a14979 lmao im genuinely worried im going to fail discrete math. I swear it’s how my professor teaches. He overcomplicates everything and he will talk about one thing for like an hour so it’s too easy to get confused.

[@saeedbaig4249]

0:56 - "Notice the smallest edge is BE, but this node connects 2 nodes that are already in the same tree, so it will not be chosen." I think you could have picked your words better. The reason we don't choose BE is NOT because B and E are already in the same tree (I mean, so were A and C, yet you added AC), but because adding BE would create a cycle in the tree, and MSTs aren't supposed to have cycles.

[@kirandhakal8601]

You cleared my confusion. Thank you.

[@keagenmccartha7412]

how is that confusing? if both points are already discovered then u arent adding a new point to the tree... its just a wasted edge

[@xbit97]

It's incredible how my teacher's lessons started talking about cycles and cuts and shit formulas while the algorithm is so freaking simple... Order edges by weight, go through them in that order, if the edge connects different trees use it, if it connects the same tree discard it, was that so difficult? Thank you for this clear explanation dude, you rock

[@miguelflor1600]

ele deu gosto porque é bueda da fixe

[@wade3ed]

tfw: this is actually really simple but your professor unnecessarily complicated it

[@w4439]

Your tutorials are the best! I learned 2 months of discrete mathematics in under 30 minutes. 5 years have passed since you posted this but it has had a larger impact on my understanding than my professor has provided all semester. Thanks.

[@MisterTipp]

Fucking legend mate!

[@darthrevan204]

4 hours of discrete mathematics lectures and seminaries ... compressed in 2 minutes. you sir, are a life saver

[@samanthajane4900]

Thanks - this was concise and helpful. It cleared up my confusion of whether the tree must be connected from the beginning or not.

[@asdf9481234]

you're making those kind of how to-videos everyone is looking for, a good explanation with no annoying blabla, thank you!

[@har0111890011]

Absolute Chad ; Saving me from my algorithms exam tomorrow. My Lecturer took so much explaining these concepts but you are a genius made it easy in no time. Cheers !

[@Unknownsoldier740]

Fast, clean, and with a good example. Quality work, you did good. Thank you.

[@gongjiaji2489]

you are my time saver, I spend many hours on PPT, blog and other videos, none of them explain so clearly in this manner. they try to be professional so that they don't speak nature language. Thank you very much.

[@KillerKillcam]

because of your videos, I learned Kruskal's and Prim's algorithms in 4 minutes. My teacher took 10 minutes to do an example of Prim's and I didn't even understand it then. thanks!

[@mitchell2719]

This was way easier than my prof's explanation. Thank you so much!

[@me-zb7qm]

Thank you so much for this, my professor didn't even explain a thing but included this in the midterm I'm having in 13 hours. You're a lifesaver.

[@SaminaAKhan-ck1oj]

You are awesome. Seriously you taught a whole book chapter in just two minutes. 👍🏻

[@marflage]

For those who are a bit confused, he did not search for 7 by skipping 4, 5, 6. He did in fact search for them but found them to be making a circuit (closed path with previously chosen nodes).

[@brettsharpe7305]

You just said he didn’t

[@AvengersTrex]

Short, simple and clear. Good work !! Many thanks to you

[@anything413]

Great stuff man,,, crisp and precise... never going to forget Kruskal's algo now

[@indieelectroworks]

Your material is simply excellent! I can't wait for more!

[@geekinthehattech]

Very nice video. Straight to the point and quick.

[@salihbalkan5083]

Perfect tutorial I have ever seen. Thanks, I got it in just 2 minutes!

[@ausreir]

Concise and easy to understand, many thanks, Michael.

[@mrbloke491]

my god man you are amazing, you just explain it without taking 10 years THANK YOU

[@AwsomeAlligator]

It would be cool if you added a short video about union and find as an addition to this video, as the intuition for Kruskal's algorithm is explained brilliantly here, but the implementation needs to use union and find for the complexity to be as good as you mention and these functions are quite interesting and not completely trivial. Thanks for all your great videos btw, they are very clear and concise :)

[@jimboi95]

Simple and straight to the point. Thankyou so much!

[@Sonikkid1]

Even in 2021, you are still relevant. Thank you for your service

[@yadvainderasood9728]

Short and comprehensive... Great job!!!

[@Elliott_Ives]

Michael, your vids are so succinct and effective.

[@alexeukleidis1611]

Sir you are the Best!!!!!!! The shortest and meaningful video that can be created!!!! Thank you SO much!!!!

[@madeleine6472]

Really saved my day after spending hours in the text books to understand this. Thanks a lot!

[@emilyhuynh7855]

You're a lifesaver! Got an exam tomorrow and my textbook nor my professor was making sense to me. Glad to know it was a much easier process than I initially thought!

[@siddharthrodrigues9445]

he's saving lives still... been 6 years!

[@curticelockhart87]

This was beautifully done, thank you!

[@OdiyaS]

Thanks!!! You literally saved me ... and my exam's tomorrow! You explained something in 2 minutes when in class it took like 2 hours!

[@BendenDrijver]

This saved me so much time. Very clear and informative video, thank you!

[@joeyyshumm]

Thank you so much. This is the clearest explanation I've seen

[@AaronccGuo]

i liked the way you guys explain it, shor and clear.

[@thomaschurch1969]

Very succinct and to the point. Thanks for this.

[@MNKW123]

Thank you!! Excellent explanation contrary to the million slides in my notes that are just plain confusing.

[@66saly]

Short and clear review, thanks 👍

[@gunjansethi2896]

Saved my life on the exam morning! Thank you so much :D

[@pchanio]

I just love that you simply get to the point.

[@MichaelSambol]

Thank you!

[@miguelflor1600]

@@MichaelSambol és bueda da fixe

[@matejpersic6601]

Thanks man! Just as your video on ford-fulkersons algorithm, simple and straight forward. Cheers

[@Khadari2013]

what amazes me is how I seat through 2 hour of lecture class and couldn't understand a jack thing but 2 minute video and I feel like replacing my professor so I can teach the class.

[@mariestolk3794]

Same

[@rrestoring_faith]

I would still suggest staying in lectures. For instance, this videos states that you can use merge sort to sort the Edges. Which is fine and true, but why would you even bother? Why use merge? Why not a priority queue? He also doesn't explain the time complexity. You can perform Kruskal's in O(ElogV) but his is O(ElogE) because merge sort is dominating. Which is better? [Most examples show E >= V]. These videos are great for getting the point and quickly understanding how it works, but when you get into it the details may not be as good as you'd think.

[@theendurance]

@Rrestoring faith Exactly. This video doesnt actually teach you anything. It simply shows what Kruskal's aglorithm is. This is way too basic to be useful

[@prajaktadeosthali3083]

Thanks a lot for this short explanation!

[@rewinder802]

short and sweet i like it. Keep up the good work!

[@SOCAL_SHORTS_FACTORY]

Saved me so much time. Thank you for great videos.

[@Xtremedave2]

Ohhh I never knew that the arcs should only add new nodes, I was only taught that it should not create cycles. This makes it a lot easier. Great vid mate

[@JamesBrodski]

Great video. Thanks so much for making it!

[@beani5355]

Straight forward👏🏼nice one

[@fcmello1]

Thanks for helping, got a test today and explained much better than my professor. Thanks a lot :D

[@felixcuello]

I wondder WHY at university they spend 20-30 minutes explaining this, and having round of questions. Your 2 minute videos explaining algorithms are simply PERFECT. Thank you very much indeed.

[@emadharazi5044]

I did not think it was possible. Nicely done

[@Lala96926]

Thank you!! You are an amazing person! You made it so simple! x

[@user-zk3bc6cc2g]

always awesome algo

[@WuddupDok]

Great explanation, thanks for this.

[@capelo2148]

You are a LIFE SAVIOR. Thanks!

[@nibrobb]

Excellent explanation!

[@avtaras]

This is amazing, love this channel! Thank you :)

[@winterfoxx6363]

This channel is the best. I wish I watched these in college. Please make more videos on algorithms topics!

[@Zeppelin-ep7uv]

excellent work, man!

[@volo7]

what a fantastic video. seriously this is a great explanation shrunk to a 2 min video

[@ejsafara456]

amazing, just what i wanted and needed

[@dlim9696]

Hi I have a final exam CS 1332 tomorrow morning and your video helped me a lot. Thanks so much and go Yellow Jackets!

[@popdud]

Ran across this video again during my university algorithm course studies. Thank again Mike!

[@MichaelSambol]

Boom! Awesome. 💪🏼❤️

[@putin_navsegda6487]

sir thank you ! it's very clean and understandable explication !

[@eunicefoo4499]

You're amazing. Thank you !

[@Bullyfan6797]

You're awesome dude, great vids

[@Punisher35709]

Awesome explanation ever!

[@howardhuang3959]

wow, that is a really nice explanation, thanks for sharing!!!!

[@Ambious]

Very intuitive, thank you!

[@mathieubrousseau92]

I love you vids, really helpful, keep it up.

[@mrndc]

From what I've learned: If you are stuck between choosing multiple edges with the same weight, like in 0:40, (A, D) or (A, C), or (B, E) Choose the one that doesn't create a cycle, if none of them create a cycle: Prioritize the edge that is alphabetically first. In this case, (A, C) is the first in the alphabetical order.

[@czoknorris]

Very nice! Thanks from Munich.

[@gilbertvirgo5672]

This is great, best Math video on KZbin.

[@aidenzhang5959]

My professor explained this for 20 minutes and couldn't make the idea clear. Thank you.

[@dnfrd2]

summer test tomorrow for my discrete math class, ur a hero

[@aluskalopes9556]

thank you so much, you helped me a lot because I will have a test about this algorithm.

[@whatthego]

Simple and no bullshit. Love it!

[@sahilghuge5302]

Generational help done by u 😭🛐

[@corvo8754]

perfect explanation

[@WVZEIJL]

Thanks fam, your review and example vids are dank af

[@ryandavis7506]

haha didn't think I'd see the word 'dank' uttered in the comment section of an algorithms review video...classic

[@WVZEIJL]

Ryan Davis ayy got a 7.7 / 10 partly thanks to this guy

[@gomes8335]

Precise and perfect

[@cwhazzoomain]

Thank you for the video!

[@popdud]

Thanks Mike!

[@li-pingho1441]

The best tutorial ever

[@mariestolk3794]

Great video, thanks!

[@JTMcAwesomeFace]

Quick and simple, thanks!

[@user-zk3bc6cc2g]

precise and concise

[@webapplicationguide3798]

Thanks for making it simple !!

[@30filip50]

Thank you so much.

[@nivekiohc]

Thank you for the help!

[@drewkelly3622]

my professor made this WAY more confusing in a 75 min lecture, you explained it perfectly in 2 minutes

[@edwardlie3845]

u help me alot man .. good jobb broo

[@StefanoWalker]

Show de bola! Me ajudou muito. Muito bom.

[@thegame619619619]

saving my final, i love you

[@SuzanaKaren]

I LOVE YOU, YOU SAVED ME! THANKS OMFG