Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem

被引:66
|
作者
Aini, Asghar [2 ]
Salehipour, Amir [1 ]
机构
[1] Islamic Azad Univ, S Tehran Branch, Sch Ind Engn, Tehran, Iran
[2] Shahid Sattari Air Univ, Sch Comp Engn, Tehran 1384637945, Iran
关键词
The shortest path problem with a cycle; The Floyd-Warshall algorithm; The Rectangular algorithm;
D O I
10.1016/j.aml.2011.06.008
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
On a network with a cycle, where at least one cycle exists, the Floyd-Warshall algorithm is one of the algorithms most used for determining the least cost path between every pair of nodes. In this work a new algorithm for this problem is developed that requires less computational effort than the Floyd-Warshall algorithm. Furthermore, we show that the basis of our algorithm is much easier to understand, which might be an advantage for educational purposes. A small example validates our algorithm and shows its implementation. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1 / 5
页数:5
相关论文
共 50 条
  • [21] An Islanding Surface Searching Approach Based on Floyd-warshall and DFS algorithm
    Liao Qingfen
    Wang Yifei
    Tang Fei
    Yang Jian
    Liu Yu
    2014 INTERNATIONAL SYMPOSIUM ON POWER ELECTRONICS, ELECTRICAL DRIVES, AUTOMATION AND MOTION (SPEEDAM), 2014, : 84 - 87
  • [22] A novel traceback model for DDoS attacks using modified Floyd-Warshall algorithm
    Emara, Sherif F.
    Abdelhady, Sayed
    Zaki, M.
    INTERNATIONAL JOURNAL OF INFORMATION AND COMPUTER SECURITY, 2023, 20 (1-2) : 84 - 103
  • [23] Closed Loop Flow Detection in Power Systems based on Floyd-Warshall Algorithm
    Wolfram, Martin
    Schlegel, Steffen
    Westermann, Dirk
    2017 IEEE MANCHESTER POWERTECH, 2017,
  • [24] Integrating Cache Oblivious Approach with Modern Processor Architecture: The Case of Floyd-Warshall Algorithm
    Endo, Toshio
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING IN ASIA-PACIFIC REGION (HPC ASIA 2020), 2020, : 123 - 130
  • [25] Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms
    Pradhan, Anu
    Mahinthakumar, G.
    JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 2013, 27 (03) : 263 - 273
  • [26] Island Partition of Distribution Network with Microgrid and Distributed Generation Based on Floyd-Warshall Algorithm
    Zhang, Hongwei
    Chen, Lei
    Wang, Hualei
    Zhao, Yuanyuan
    Chen, Longlong
    Duan, Bo
    2018 INTERNATIONAL CONFERENCE ON SMART GRID AND ELECTRICAL AUTOMATION (ICSGEA), 2018, : 29 - 33
  • [27] Modified Floyd-Warshall's Algorithm for Maximum Connectivity in Wireless Sensor Networks under Uncertainty
    Sahoo, Laxminarayan
    Sen, Supriyan
    Tiwary, Kalishankar
    Samanta, Sovan
    Senapati, Tapan
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2022, 2022
  • [28] Speeding Up Shortest Path Algorithms
    Brodnik, Andrej
    Grgurovic, Marko
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 156 - 165
  • [29] Modified Floyd-Warshall Algorithm for Equal Cost Multipath in Software-Defined Data Center
    Ojo, Akinniyi
    Ma, Ngok-Wa
    Woungang, Isaac
    2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION WORKSHOP (ICCW), 2015, : 346 - 351
  • [30] Speeding up Martins' algorithm for multiple objective shortest path problems
    Demeyer, Sofie
    Goedgebeur, Jan
    Audenaert, Pieter
    Pickavet, Mario
    Demeester, Piet
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2013, 11 (04): : 323 - 348