The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.
Proceedings of the 2016 International Conference on Advanced Mechatronic Systems, Melbourne
Dijkstra’s algorithm; Single valued neutrosophic number; Shortest path problem; Network
Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, & Luige Vladareanu. (2016). Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem. In Proceedings of the 2016 International Conference on Advanced Mechatronic Systems, Melbourne. 5 pages. http://doi.org/10.5281/zenodo.888833
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.