Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Chongqing Institute of Technology(Natural Science)》 2008-05
Add to Favorite Get Latest Update

Some Discussions on Floyd Algorithm

HAO Zi-jun1,HE Shang-lu2(1.School of Information and Calculating Science,North University for Nationalities,Yinchuan 750021,China;2.School of Mathematics,Physics & Software Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China)  
Floyd algorithm is usually used in shortest path when a graph does not include negative circuit.This article first discusses this algorithm,and then gives some modification of the calculating process of this algorithm.The modified algorithm can produce the shortest paths between peaks with simple calculation when it comes to networks with not too big number of orders.
【Fund】: 北方民族大学科研项目(2007Y044)
【CateGory Index】: O224
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved