In a weighted graph, the minimum spanning tree (MST) tries to minimize
a. the number of edges from the starting vertex to a specified vertex.
b. the number of edges connecting all the vertices.
c. the total weight of the edges from the starting vertex to a specified vertex.
d. the total weight of edges connecting all the vertices.
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.