Shaista Habib1, Aqsa Majeed1, Muhammad Akram2,*, Mohammed M. Ali Al-Shamiri3,4
CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.3, pp. 2873-2894, 2023, DOI:10.32604/cmes.2023.026294
Abstract The Floyd-Warshall algorithm is frequently used to determine the shortest path between any pair of nodes. It
works well for crisp weights, but the problem arises when weights are vague and uncertain. Let us take an example
of computer networks, where the chosen path might no longer be appropriate due to rapid changes in network
conditions. The optimal path from among all possible courses is chosen in computer networks based on a variety
of parameters. In this paper, we design a new variant of the Floyd-Warshall algorithm that identifies an All-Pair
Shortest Path (APSP) in an uncertain situation of a… More >
Graphic Abstract
Login
Register
