Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

The Floyd Dynamic Optimization Algorithm of the Sparse Network

WU Guo-lin1,JIN Zhen2,DENG Xiao-fang3(1.Department of Information Engineering,Guilin University of Aerospace Techology,Guilin Guangxi 541004,China; 2.Department of Science,Nanchang Institute of Technology,Nanchang Jiangxi 330099,China; 3.Software School,Jiangxi Normal University,Nanchang Jiangxi 330022,China)  
By searching for Floyd algorithm,a new method between any two nodes of the shortest path algorithm is proposed,which is Floyd dynamic optimization algorithm.By introducing insert array,reachable array and starting-off array,the algorithm changes automatically path nodes,eliminates some useless nodes and minimizes the number of execution statements before solving the shortest path.The algorithm analysis shows that the new algorithm has more performance than Floyd algorithm in sparse network.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved