An Algorithm for the Cycled Shortest Path Problem

• Main Authors: Amir Salehipour, Asghar Aini
• Format: Article
• Language: fas
• Published: Allameh Tabataba'i University Press 2011-07-01
• Series: Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī
• Subjects: The Shortest Path Problem; Shortest Path Network with cycle; Floyd-Warshall Algorithm; Rectangular Algorithm
• Online Access: http://jims.atu.ac.ir/article_4497_4fe0370c52c56cf608b193bb5417f3ad.pdf

For a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with cycle. In this paper, a new algorithm for this problem which requires less computational effort than the Floyd-Warshall algorithm has been developed Furthermore, it can be shown that the basis of our algorithm is much easier to be learnt and understood which might be an advantage for educational puposes. A small example validates our algorithm and shows its implementation.