I know they both serve the same purpose of finding the minimum spanning tree, but the approach is different. Is one approach better than the other? Does it make a difference in real life application?
Follow Math Help Forum on Facebook and Google+
algorithm - Kruskal vs Prim - Stack Overflow
one vs. the other appears to have to do with the number of edges and the density of your graph