Kruskal’s Minimum Spanning Algorithm

  1. Sort all the edges from low weight to high
  2. Add the spanning tree to the edge with the lowest weight. If adding the edge resulted in a cycle, discard it.
  3. Continue to add edges until we’ve reached all of the vertices.

--

--

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