Pre

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in