Description: 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.
To Search:
File list (Check if you may need any files):
K最短路问题.doc
Download