Description: 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?
To Search:
File list (Check if you may need any files):
寻径问题\Debug\StdAfx.obj
........\.....\vc60.idb
........\.....\vc60.pdb
........\.....\寻径问题.exe
........\.....\寻径问题.ilk
........\.....\寻径问题.obj
........\.....\寻径问题.pch
........\.....\寻径问题.pdb
........\ReadMe.txt
........\StdAfx.cpp
........\StdAfx.h
........\寻径问题.cpp
........\寻径问题.dsp
........\寻径问题.dsw
........\寻径问题.ncb
........\寻径问题.opt
........\寻径问题.plg
........\Debug
寻径问题
Download