数据结构 寻径问题。内容：给定n个村庄之间的交通图，若村庄i和村庄j之间有道路，则将顶点i和顶点j用边连接，边上的权Wij 表示这条道路的长度。现在要从这n个村庄选择一个村庄建一所医院，问这所医院应建在哪个村庄，才能使离医院最远的村庄到医院的距离最短？-Routing data structure problem. Content: Given n traffic between villages map, if the village i and the road between the villages of j, then vertex i and j vertices connected by edges, the edge of the right Wij that the length of this road. Now choose a village from which n build a hospital in a village, and asked the hospital to be built in which the village in order to make the villages furthest away from the hospital the shortest distance to the hospital?