By mitchp
via ruby.dzone.com
Published: Jan 29 2013 / 08:35
I recently wrote a blog post describing my implementation of Kruskal’s algorithm – a greedy algorithm using to find a minimum spanning tree (MST) of a graph – and while it does the job it’s not particularly quick.
Add your comment