In python , implement Prim's greedy algorithm for finding a minimum-spanning tree in a weighted undirected graph.

The program needs to be able to parse and test against the graph in a weighted edge file "file.txt"

The program needs to output the distance between each pair of vertices as well as the cumulative and total distance of the resulting minimum-spanning trees.

file.txt example:

Albany Ashland 219 Albany Astoria 158 Albany Baker.City 351 Albany Bend 123