Given a graph with n(<=100) vertices and m( <=n(n-1)/2 ) edges, you are asked to find a spanning tree with the minimum difference between the biggest and the smallest edge of the tree.
The problem can be found Here (UVA 1395). I can't figure out an efficient way to solve this. Any kind of help is appreciated.