Problem
1. Implement the Prim-Jarník algorithm assuming that the edge weights are integers.
2. Perform an experimental comparison of two of the minimum spanning tree algorithms discussed in this chapter (Kruskal and Prim-Jarník). Develop an extensive set of experiments to test the running times of these algorithms using randomly generated graphs.