摘要
介绍了闭合螺线阵列的概念;利用动态规划法中的Floyd算法思想对求解闭合螺线阵列最短路径的问题进行了描述,并给出了具体算法;给出了利用二维数组算法求解闭合螺线阵列最短路径的过程。对于以上两种算法的优缺点进行了比较。这两种算法可以用于解决大多数路径问题。
The Floyd algorithm in the dynamic programming method to get the shortest path of the closed spiral array,after introducing the concept of the Closed Spiral Array,is proposed,and a concrete realization of algorithm is given.Then the method of using two-dimensional array algorithm to get the shortest path of the closure spiral array is also described.Finally,these two algorithms which can both be used to solve the path problem are compared.
出处
《计算机时代》
2012年第8期32-33,36,共3页
Computer Era
