• edited by
13,999 views
32 32 votes

Consider the following graph:

Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal’s algorithm? 

  1. $(a-b),(d-f),(b-f),(d-c),(d-e)$
  2. $(a-b),(d-f),(d-c),(b-f),(d-e)$
  3. $(d-f),(a-b),(d-c),(b-f),(d-e)$
  4. $(d-f),(a-b),(b-f),(d-e),(d-c)$

3 Answers

Best answer
37 37 votes

In Kruskal's algo the edges are added in non decreasing order of their weight. But in Option D edge $d-e$ with weight $3$ is added before edge $d-c$ with weight $2$. Hence, option D is wrong option.

Correct Answer: $D$

• edited by
0 0 votes
in short we have to remember for this type of question ascending order also must satisfy for MST

Verify ?
Answer:
Position:
Show:

Related questions

51 51 votes
14 answers 14 answers
23.8k
23.8k views
Rucha Shelke asked Sep 16, 2014
23,802 views
Consider a weighted complete graph $G$ on the vertex set $\{v_1,v_2,.....v_n\}$ such that the weight of the edge $(v_i, v_j)$ is $2|i-j|$. The weight of a minimum spanni...
155 155 votes
18 answers 18 answers
37.9k
37.9k views
Rucha Shelke asked Sep 26, 2014
37,894 views
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$...
92 92 votes
10 answers 10 answers
45.4k
45.4k views
Rucha Shelke asked Sep 16, 2014
45,370 views
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:QueueStackHeapB-Tree
65 65 votes
11 answers 11 answers
31.8k
31.8k views
gatecse asked Feb 14, 2018
31,767 views
Consider the following undirected graph $G$:Choose a value for $x$ that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $...