Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem
| Main Authors: | Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, Luige Vladareanu |
|---|---|
| Format: | Article Journal |
| Terbitan: |
, 2016
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/888833 |
Daftar Isi:
- 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.