Scroll down to $10\mathrm{.}3\mathrm{.}2$ Kruskal's Algorithm

Read algorithm $10\mathrm{.}3\mathrm{.}9$

In step $2,$ if fewer than m $-1$ edges are selected, then G is a

Question $8$ options:

cycle

disconnected graph

minimal spanning tree

path