Kruskal's Minimum Spanning Tree - CodeProject

An example of a .NET implementation of Kruskal’s algorithm for finding the minimum spanning tree of a connected, undirected graph.; Author: Apostol Bakalov; Updated: 2 Nov 2011; Section: Algorithms & Recipes; Chapter: General Programming; Updated: 2 Nov .

www.codeproject.com