Closed zche377 closed 3 years ago
In minimum spanning tree, can we assume that there's no vertex with zero edge, since by definition "a spanning tree in a graph is a tree that contains all vertices in the graphs as its nodes"?
Very good question. I think we need to assume all vertices are at least somehow connected, otherwise, the MST concept does not work.
thank you!
In minimum spanning tree, can we assume that there's no vertex with zero edge, since by definition "a spanning tree in a graph is a tree that contains all vertices in the graphs as its nodes"?