Multiple choice

Consider the following graph:

Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal's algorithm?

  1. (b,e) (e,f) (a,c) (b,c) (f,g) (c,d)

  2. (b,e) (e,f) (a,c) (f,g) (b,c) (c,d)

  3. (b,e) (a,c) (e,f) (b,c) (f,g) (c,d)

  4. (b,e) (e,f) (b,c) (a,c) (f,g) (c,d)
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Krushal's algorightm, arranging edges in ascending order.

Keep practicing — related questions