Title: Solving shortest path using modified Dijkstra's algorithm with spherical neutrosophic numbers as arc length

Authors: Prasanta Kumar Raut; Siva Prasad Behera

Addresses: Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India ' Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India

Abstract: The shortest path problem is a fundamental problem in network analysis, and many algorithms have been developed to solve it efficiently. One of the most widely used algorithms is Dijkstra's algorithm, which finds the shortest path between two nodes in a graph. Recently, spherical neutrosophic numbers (SNNs) have emerged as a powerful tool for handling uncertain information in network domains. In this study, we propose a modified version of Dijkstra's algorithm that uses SNNs to handle uncertainty in edge weights in a network. The edge weights are represented as SNNs to account for uncertainty in the distances between vertices, and the algorithm is modified to handle the arithmetic operations of SNNs and update distances and priorities accordingly. Our results show that the algorithm can effectively handle uncertainty in the network domain and find the shortest path between two nodes with high accuracy.

Keywords: connected network; Dijkstra's algorithm; shortest path problem; spherical neutrosophic numbers; SNNs.

DOI: 10.1504/IJRIS.2025.148024

International Journal of Reasoning-based Intelligent Systems, 2025 Vol.17 No.4, pp.267 - 271

Received: 03 May 2023
Accepted: 29 May 2023
Published online: 15 Aug 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article