Floyd算法的改进与优化

介绍一个改进的Floyd算法。本文综合运用C＋＋语言编程技术,设计并实现了求带权有向图中各个顶点之间最短路径的算法,反映了最短路径序列上前后两个顶点之间的先后关系。本算法从顶点出发,每次在求各顶点间最短路径的时候,都进行路径优化。改进后的Floyd算法,迭代速度快,计算量一定程度减少。

Improvement and Optimization of Floyd Algorithm

This paper introduces an improved Floyd algorithm.By comprehensively using C ＋＋ Language Programming Techniques,we design and achieve the algorithm of the shortest path among the vertexes in a weighted directed graph,which reflects the sequential relationships between two vertexes before and after the shortest path. Started from the vertexes,the improved algorithm would make paths optimization when we calculate the shortest path among the vertexes every time.What＇ s more,the improved Floyd algorithm has a rapid iterative speed and its calculated quantity has been reduced to a certain extent.