There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
Meanwhile, combining these two ideas, we propose a new kind of single-source shortest path algorithm based on bucket structure, which has good time complexity and parallelism property.
同时，提出了结合这两类算法思想的一种基于桶结构的单源最短路径串行算法，算法具有好的运行时间复杂度和可并行性。
应用推荐