Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
2 votes
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
in Graph Theory 392 views

2 Answers

3 votes


In original krushal's algorithm, we were including edges till it doesn't form a cycle in increasing order of weight. This will ensure maximum weight edge in a cycle is never included.

Here, if there is a cycle then to get MST we will always like to delete edge with maximum weight,

So both are effectively doing the same thing. 

Useful read:

0 votes
Yes it does.

Related questions

1 vote
2 answers
3 votes
3 answers
0 votes
1 answer
Your college has sent a contingent to take part in a cultural festival at a neighbouring institution. Several team events are part of the programme. Each event takes place through the day with many elimination rounds. Your contingent is multi-talented and each ... is: Find a maximum length simple cycle Find a maximum size independent set Find a maximum matching Find a maximal connected component
asked Sep 13, 2019 in Graph Theory gatecse 119 views
2 votes
0 answers
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
asked Nov 11, 2017 in Graph Theory Parshu gate 380 views