Data Structures and Algorithms

Kruskal's Algorithm

	gh is shortest
	ci creates two trees
	fg is next shortest
	ab creates a 3rd tree
	Add to existing tree
	Cycle created,
	add cd instead
	hi makes a cycle
	Add ah instead