Question

If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.

(a) True

(b) False

The question was posed to me in an online interview.

My query is from Minimum Spanning Tree in portion Minimum Spanning Tree of Data Structures & Algorithms II

Answer 1

The correct answer is (a) True

The best explanation: A subgraph is a graph formed from a subset of the vertices and edges of the original graph. And the subset of vertices includes all endpoints of the subset of the edges. So, we can say MST of a graph is a subgraph when all weights in the original graph are positive.