Kruskal’s Minimum Spanning Tree Algorithm

A description of the Kruskal’s Minimum Spanning Tree Algorithm is available on Wikipedia. I have reproduced the example graph from the Wikipedia article in several formats.

Download various formats of both the initial graph and the final minimum spanning tree.

wiki kruskal example

Download various formats of the initial graph.

wiki kruskal example mst

Download various formats of the final minimum spanning tree.

This minimum spanning tree was produced by my implementation of Kruskal’s algorithm for my spanning tree module contribution to Gephi, an open-source graph visualization project. I suggest analyzing this post’s data with Gephi, but the included formats are fairly standard, so you may still have success with other graph visualizers.

Happy Spanning!

Computing, ProjectsPermalink

Leave a Reply

Your email address will not be published. Required fields are marked *


five × eight =

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>