## Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem

**Authors:** Said Broumi, Mohamed Talea, Assia Bakali, Florentin Smarandache

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

**Comments:** 5 Pages.

**Download:** **PDF**

### Submission history

[v1] 2017-01-10 08:51:57

**Unique-IP document downloads:** 9 times

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*