Implementation of kruskal's algorithms for finding mst and strong components on graphs using Boost and Leda library.