Abstract：There are four major algorithms to solve the problem of network shortest path in operational research，graph theory，data structures．They are Dijkstra algorithm，successive approximation algorithm，matrix algorithm，and Floyed algorithm．Because these algorithms are in different subjects，so it is hard to analyze and summarize of them．This paper mainly analyzes and compares matrix algorithm and Floyed algorithm，describes their functions，principle and the differences and similarities，to choose the reasonable algorithm in practical applications．
2010, Vol. 1 