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.

第五题
......\AdjMWGraph.h
......\CreatAdjMWGraph.h
......\Debug
......\GraphTest.cpp
......\GraphTest.dsp
......\GraphTest.dsw
......\GraphTest.ncb
......\GraphTest.opt
......\GraphTest.plg
......\SeqList.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．