K shortest path problem. We now know how to find single source shortest path problem, but in practice, sometimes need to know the shortest path in addition to, but still need to solve the second or third most short path, that is, to know more than most short and to increase the length of the order of discharge. If the communication network, and sometimes interrupted on certain routes, you need to find an alternative solution, which needs to find the shortest path for a rainy day a few. As a class of more than one shortest path problem is known as the K shortest path problem.

K最短路问题.doc

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