Both Prims and Kruskal algorithms are greedy algorithms and both use a minimum spanning tree (MST). They are greedy because they pick the smallest weighted edge that does not cause a cycle in the MST ...