Consider the given graph. What is the weight of the minimum spanning tree using Prim’s algorithm, starting from vertex a if the edge 10 is replaced by weight 20 ?

Posted on by