Minimum spanning tree variation [HELP]

Правка en1, от Aritra741, 2019-08-09 20:19:21

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.

Теги mst, dsu

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Aritra741 2019-08-10 09:20:41 138
en1 Английский Aritra741 2019-08-09 20:19:21 457 Initial revision (published)