Henry Chen

## Information about Algorithm Finds the minimum spanning tree of a graph by a greedy algorithm. It takes two sets of vertices, those in the MST and those not in...