首页    期刊浏览 2024年12月02日 星期一
登录注册

文章基本信息

  • 标题:A SPECIAL MATRIX POWER OPERATION DEVELOPMENT FOR SIMULTANEOUS CALCULATION OF ALL NETWORK'S SHORTEST PATH
  • 本地全文:下载
  • 作者:HITAPRIYA SUPRAYITNO ; INDRASURYA B. MOCHTAR ; ACHMAD WICAKSONO
  • 期刊名称:Journal of Theoretical and Applied Information Technology
  • 印刷版ISSN:1992-8645
  • 电子版ISSN:1817-3195
  • 出版年度:2014
  • 卷号:62
  • 期号:1
  • 出版社:Journal of Theoretical and Applied
  • 摘要:Network's shortest paths calculation is an important need in transportation network analysis. The Dijkstra algorithm has long been developed for the shortest path of a pair of nodes calculation individually. A more practical method to simultaneously calculate all shortest paths of all pair of nodes of a network needs to be developed. This paper presents the development of a method to calculate simultaneously all shortest paths of all pairs of nodes of a network. This calculation method, called a Min-Plus Algebra, is a modification of Max-Plus Algebra, having a special Matrix Power Operation, enable and easier to be executed in spread-sheet software.
  • 关键词:Simultaneous shortest path calculation; Matrix power operation; Min-Plus Algebra; Max-Plus
国家哲学社会科学文献中心版权所有