Prim's algorithm in haskell with proof

Greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. Implementation in haskell with proof. https://en.wikipedia.org/wiki/Prim%27s_algorithm#:~:text=In%20computer%20science%2C%20Prim's%20algorithm,in%20the%20tree%20is%20minimized. ... https://www.youtube.com/watch?v=KJkpvt2787g