说明：  数据结构大作业 Choose_Best_Address_For_Hospital 寻径问题: 给定n个村庄之间的交通图，若村庄i和村庄j之间有道路，则将顶点i和顶点j用边连接，边上的权Wij 表示这条道路的长度。现在要从这n个村庄选择一个村庄建一所医院，问这所医院应建在哪个村庄，才能使离医院最远的村庄到医院的距离最短？试设计一个算法来解决该问题。
(Great job data structure Choose_Best_Address_For_Hospital routing problem: Given n traffic between villages map of the village if the village i and j between the roads, will be vertex i and vertex j with edge connectivity, the edge of the right to express this Wij The length of the road. Now select from this n-a village in the village build a hospital, and asked the hospital to be built in which the village in order to make the furthest away from the hospital' s distance from the village to the hospital the shortest? Try to design an algorithm to solve the problem.)