Kruskal's

Sort all edges by weight, add each one if it doesn't form a cycle — good for sparse graphs.