Minimum Spanning Trees and Kruskal’s Algorithm implemented in Rust.

In this story we are going to look at the famous algorithm of Kruskal to find a minimum spanning tree in a connected graph.

Remember, a tree is a connected graph without cycles. A spanning tree of a graph G is a sub-graph of G that is a tree and contains all vertexes of G. A weighted graph is a graph together with a function w assigning to each edge…

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
applied.math.coding

applied.math.coding

I am a mathematician and software developer who likes writing advanced code and to do research in applied and pure mathematics.