Suppose following weighted directed graph representing a local subway route network, the vertices in the graph represent the important sites in the area, the arcs represents the existing subway routs, and the weight represent the time duration from one site to another one. Try to design a subway route query system to help the users find (a) the way to go from one site to another one in shortest time(weighted shortest path) (b) the way to go from one site to another one with minimal transfer(unweighted shortest path), for the routes with same transfer times choose the one costing shortest time.

Filename	Size	Update
lab6.cpp	9414	2017-12-30
lab6.exe	376382	2017-12-30

• 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．