1. How can I prove that for each mst there exist a prim's running that return him?(when the algorithm of prim choose the edge by their sort )
2. How can I prove that if there is no 2 edges with the same weight then there exist only 1 mst?
sorry about my English and thank U
