A minimum spanning tree is a graph in which
a. the number of edges connecting all the vertices is as small as possible.
b. the number of edges is equal to the number of vertices.
c. all unnecessary vertices have been removed.
d. every combination of two vertices is connected by the minimum number of edges.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.