GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
37 views
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For each edge, delete it from T if that edge belongs to a cycle in T. Assuming all the edge costs are distinct, does this new algorithm correctly compute a MST?

 

a) Yes

b) no

c) cant say
asked in Graph Theory by (21 points)   | 37 views

Please log in or register to answer this question.

Related questions

0 votes
1 answer
2
+1 vote
2 answers
3
asked in Graph Theory by shikharV Boss (5.7k points)   | 262 views


Top Users Sep 2017
  1. Habibkhan

    7194 Points

  2. Warrior

    2686 Points

  3. Arjun

    2594 Points

  4. rishu_darkshadow

    2568 Points

  5. A_i_$_h

    2280 Points

  6. nikunj

    1980 Points

  7. manu00x

    1856 Points

  8. makhdoom ghaya

    1770 Points

  9. Bikram

    1744 Points

  10. SiddharthMahapatra

    1718 Points


26,163 questions
33,743 answers
79,991 comments
31,123 users