closed by
2,340 views
0 votes
0 votes
closed with the note: Resolved

I am getting B and C both. Answer is given as C. Where am I wrong?

closed by

Related questions

1 votes
1 votes
0 answers
1
just_bhavana asked Oct 30, 2017
839 views
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm.Justify this statement.
3 votes
3 votes
1 answer
2
pC asked Sep 22, 2017
2,522 views
Explain Prims AlgorithmAnalysis Of Time ComplexityHow does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
5 votes
5 votes
3 answers
3
Kapil asked Jan 24, 2017
3,411 views
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ?Any example which favours this ?