给定n个小区之间的交通图。若小区i与小区j之间有路可通，则将顶点i与顶点j之间用边连接，边上的权值 表示这条道路的长度。现在打算在这n个小区中选定一个小区建一所医院。试问这家医院应建在哪个小区，才能使距离医院最远的小区到医院的路程最短？请设计一个算法求解上述问题。-N given the traffic between plots Fig. If the cell i and cell j can pass between the road will be vertex i and vertex j with edges between the connections, the weights of the edge that this path length. Now intend to n small areas in the selection of a residential building of the hospital. How the hospital should be built in the district which can make the furthest distance from the hospital district to the hospital the shortest distance? Please design an algorithm to solve the aforementioned problems.