Register
What’s the correct answer
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
← Prev Question Next Question →

No related questions found

Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Other Questions

How do you can you solve this problem 37 + y = 87; y =
What is .725 as a fraction
How do you estimate of 4 5/8 X 1/3
A bathtub is being filled with water. After 3 minutes 4/5 of the tub is full. Assuming the rate is constant, how much longer will it take to fill the tub?
i have a field 60m long and 110 wide going to be paved i ordered 660000000cm cubed of cement  how thick must the cement be to cover field
Link Copied!