Multiple choice

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)
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Keep practicing — related questions