Consider the following graph. Using Kruskal’s algorithm, which edge will be selected first?
|Answer» C. be|
|Explanation: in krsuskal’s algorithm the edges are selected and added to the spanning tree in increasing order of their weights.|
Login to Continue
It will take less than 2 minutes