General Mathematics


Application of Dijkstra Algorithm for Solving Interval Valued Neutrosophic Shortest Path Problem

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

In this paper, the authors propose an extended version of Dijkstra’ algorithm for finding the shortest path on a network where the edge weights are characterized by an interval valued neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2017-05-29 08:57:42

Unique-IP document downloads: 13 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

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.

comments powered by Disqus