An improved Floyd algorithm for all-pairs shortest path problems is proposed, based on Gauss-Seidel iteration thought. The shortest-path distance can be obtained quickly in two iterations, by calculating the weight adjacent matrix with row index and column index from small to large and from large to small at the same time. Algorithm analysis and calculation examples show that the improved Floyd algorithm is improved in the amount of iterations and efficiency.