Minimum Spanning Tree
Minimum Spanning Tree. Given a weighted graph G = (V, E), generate a spanning tree T = (V, E’ ) such that the sum of the weights of all the edges is minimum. Applications On Euclidean plane, approximate solutions to the traveling salesman problem ,
648 views • 18 slides