Abstract: Path analysis is the most basic problem in network analysis, its core problem is how to solve the shortest path between two point. The shortest path algorithm optimization is directly related to network analysis technology and its algorithm will affect the performance of associated software. Basic idea, steps, and time complexity of Floyd algorithm is analyzed in detail and time Complexity of three algorithm was compared, Finally, Floyd algorithm with JAVA language, Floyd algorithm for the master, and optimization of the reference model was illustrated by demo program.