Greedy Algorithms - School of Computer Science | The University of Manchester

PROBLEM : Devise an algorithm to find a minimum spanning tree. Kruskal's Algorithm Greedy algorithm to find minimum spanning tree. Want to find set of edges T. Start with T = EMPTY SET Keep track of connected components of graph with edges T Initially ...

www.cs.man.ac.uk