Description: Routing problem: given n villages between traffic map, if i have a road between the village and the village j, then the vertex i and j vertices connected by edges, Wij represents the length of the right side of this road. N from these villages now choose a village to build a hospital, ask the hospital to be built in the village which, in order to make the village furthest from the hospital to the shortest distance from the hospital? Realize functions: 1 automatically generated data 2 automatically generated string 3 shows the matrix 4 judgment entered illegally 5 to repeatedly enter the same data available to determine 6 dynamically generated one-dimensional array. .. .. two-dimensional array 7 compares the values within the array, and output 8 lookup identifier and the location in the array output 9 to create network 10 Find the value within the network as well as the value of the deal
To Search:
File list (Check if you may need any files):
main.cpp
__MACOSX
........\._main.cpp
Download