【摘要】 本文介绍了三种最短路径算法及其算法步骤，这三种算法分别被称为Ｄｉｊｋｓｔｒａ算法、ＰＳＰ算法和ＤＢＦＳ１算法。文中对这三种算法的比较，着重阐述了作为一种在计算机上非常优越的算法ＤＢＦＳ１算法的优越性及其原因。最后，给出了ＤＢＦＳＬ１算法的流程图。更多还原

【Abstract】 his paper presents three shortest path algorithms,which are quite popular at pres-ent,and their algorithmic procedure.These three algorithms are respectively called Dijkstra algorithm,PSP(partitioning shortest path)algorithm and DBFS1(Dynamic Breadth-First Search algorithm,By comparing these three algorithms,this paper puts emphasis on expounding the advan- tage of DBFS1 algorithm,the extremely superior algorithm,and the reason. Lastly,this paper pres-ents the flow diagram of DBFS1 algorithm.更多还原