Research on the Shortest Path of the Improved Floyd Algorithm Integrating Path Generation Process
In order to solve the problem of missing nodes in the generation path of traditional Floyd algorithm,three methods of path construction are proposed to improve Floyd algorithm.Firstly,the process of constructing the path by three methods is deduced by algebraic method,and the correctness of the three methods is proved respectively.In the next section,it is proved that node omission exists in the path generated by Floyd algorithm based on the combination method of"recursion method+successor vertex method"under the condition that Increase/decrease sequence has one of the seed strings of"zz""zjz"or"jzj",and the reason of node omission is explained.Finally,the author gives some suggestions on how to write Floyd algorithm correctly.The experimental results show that the three methods of path construction improved by Floyd algorithm can generate the shortest path without missing nodes.
国家科技期刊平台
NSTL
万方数据
