条最短路径 meaning in Chinese

k shortest path

We adopt k shortest paths into routing and choose the best route in them considering link costs , links hops and the number of no - utilized wavelength in a link
路由选择采用k条最短路径算法进行,备选路由集中首选最佳路由时考虑链路的代价,跳数和每一条链路上不可用波长数。
Firstly , according to our study on the psychology of travelers , we build the passenger - route - select model with the purpose of " least change firstly , shortest distance secondly " , propose the question of bus route aggregation and the n shortest paths algorithm combining dijkstra algorithm and moore - pape " s chain table management technology , which is proved valid
首先在对乘客出行心理研究基础上，提出了“以换乘次数最少为第一目标，距离最短为第二目标”的公交乘客出行路径选择模型和公交路径集问题以及结合dijkstra算法和moore ? pape算法链表管理技术的n条最短路径算法，系统的运行结果验证了该算法的有效性。