Answer to Question #329873 in Algorithms for Anuj Yadav

Question

You are given a graph G = (V, E) where the weights of the edges can have

only three possible values - 2, 5 and 7. Design a linear time , that is O(E + V) time algorithm to find the minimum spanning tree of G. Hint: Modify a known algorithm.

Answer 1

It's been a while since this question is posted here. Still, the answer hasn't been got. Consider converting this question to a fully qualified assignment, and we will try to assist. Please click the link below to proceed: Submit order