Graph theory problem

Правка en1, от surajkvm007, 2016-03-08 22:14:10

Given a forest with n vertices, add edges to make it into a tree with minimal diameter. I tried many approaches but none of them passed system test cases.Please suggest some algorithm to solve this problem.

Теги algorithm, graphs, minimization

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский surajkvm007 2016-03-08 22:14:10 227 Initial revision (published)