If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
|Answer» A. true|
|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.|
Login to Continue
It will take less than 2 minutes