Explain about Minimum cost spanning tree?
Answers
Answered by
1
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components.
HOPE IT HELPS YOU
PLZ MARK ME AS BRAINELIST
#BE BRIANLY
HOPE IT HELPS YOU
PLZ MARK ME AS BRAINELIST
#BE BRIANLY
Similar questions