Register

What’s the correct answer

What’s the correct answer
asked 35.7k views
4 votes
What’s the correct answer

What’s the correct answer-example-1
asked
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

answered
User Khakionion
by
8.4k points
← Prev Question Next Question →

No related questions found

Ask a Question
Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.

Categories

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
Link Copied!