Kruskal´s Algorithm (Explained)
What the Kruskal’s algorithm does is find the minimum spanning tree of a undirected edge-weighted graph.
So in what situations do you use Kruskal’s algorithm and how do you implement it? In this video I am going to be sharing with you my tips for its fast implementation so if you have trouble understanding what Kruskal’s algorithm is used for and how to implement it, this video is for you.
So what is a minimum spanning tree?
Well a minimum spanning tree is a subset of edges of a connected undirected graph, that connects all the vertices together, without any cycles and with the minimum possible total edge weight.
So basically we will take a look at a graph, and more precisely at its edge weights, pick the edge that has the lowest weight and start building the minimum spanning tree starting from that precise edge without creating any cycles.
In Kruskal’s at each stage, you look at the globally smallest edge that does not create a cycle in the current forest and pick that to be the next edge in the minimum spanning tree.
Let's connect:
Instagram: @biancadata
Twitch: bianca_jordan
Website: www.biancadata.com
Contact: info@biancadata.com
Auf dieser Seite können Sie das Online-Video Kruskal´s Algorithm (Explained) mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer Bianca Jordan 25 Oktober 2020 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 2,861 Mal angesehen und es wurde von 99 den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!
