Question

For minimum spanning tree (MST) construction, Kruskal’s algorithm selects an edge.

a) with maximum number of vertices connected to it

b) with minimum weight so that cost of MST is always minimum

c) that does not introduce a cycle

d) none of the above

Answer 1

For minimum spanning tree (MST) construction, Kruskal’s algorithm selects an edge.??

if one option need to be chosen it is b.

if more than one option need to be chosen then its b and c

please upvote and comment for doubts