Home »
MCQs »
Algorithms MCQs
In Kruskal's algorithm, first sort all graph edges in increasing order.
12. In Kruskal's algorithm, first sort all graph edges in increasing order.
- True
- False
- Can't say anything
- Your choice
Answer
The correct answer is: A) True
Explanation
In Kruskal's algo, the first step is sorting all the edges of the graph in increasing order.