149
click to vote
DAM
2000
15 years 3 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to