35.7k views
4 votes
What’s the correct answer

What’s the correct answer-example-1
User DarkTrick
by
7.8k points

1 Answer

7 votes

Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest.

Here, in this problem least possible weight is 2, AE.


Answer: AE

User Khakionion
by
8.4k points

No related questions found