The Cycled Shortest Path Problem: A New Perspective, And Sensitivity Analysis
Asghar Aini, Kourosh Eshghi & Amir Salehipour · Journal of Advances in Mathematics and Computer Science · 2017
Several algorithms, including the Floyd-Warshall algorithm, have been developed to calculate the shortest path between every pair of vertices in a graph (network) with cycles. This study proposes an exact algorithm, the Cascade Rectangle (CR) algorithm, for calculating the shorte...
Open access
Research Article
10.9734/JAMCS/2017/34933