InterviewSolution
Saved Bookmarks
| 1. |
Explain about Minimum cost spanning tree? |
|
Answer» 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. |
|