- 1. Sort the edges in increasing order
2.binary search on the sorted list
3.check if using d = Edge[mid] , can we cover all the points using S satellites ( or disconnected regions )
How to do ??? We have a sorted list , use kruskal to find the disconnected regions
Solution order : Sorting time ( O (n^2 log n) )
10369 - Arctic Network
Moderator: Board moderators
-
- Learning poster
- Posts: 96
- Joined: Tue Apr 23, 2013 12:54 pm