Minimum Spanning Tree Problem

• Input: Undirected Graph G = (V,E) and a cost function C from E to the reals. C(e) is the cost of edge e.

• Output: A spanning tree T with minimum total cost. That is: T that minimizes

Previous slide

Next slide

Back to first slide

View graphic version