graph theory

Exercise 46. Draw a connected graph, with each edge having a non- negative weight. Apply the Prim-Jarnk algorithm to find a minimum span- ning tree. On the same graph, apply the algorithm with different root vertices. Repeat Show that the Prim-Jarnk algorithm can be implemented in O(mn) time, where m is the number of edges and n the number of vertices of G Exercise 48. Show that if every edge in a connected graph has a distinct weight, then there is a unique minimum spanning tree