I got this question : Given weighted graph with several of unknown weights ,decide for every edge if its in MST , not in MST or we dont have enough information to decide.
I know that are few terms to decide for ever edge :
1.If the edge is the heaviest in a circle so it is not in the MST.
2.If the edge is the minimun in a cut so it is in the MST.
I tried to use prim algorithm and to use those terms but my problem if that i dont know which edge to choose in every step if there is an unknown wheighted edge in the cut.
Thanks.