In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest path length from source node to destination node based on a ranking method. Finally a numerical example is presented to illustrate the efficiency of the proposed approach
Comments: 6 Pages. 2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA), Gdynia Maritime University, Gdynia, Poland, 3-5 July 2017.
[v1] 2017-09-06 05:08:06
Unique-IP document downloads: 52 times
Vixra.org 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. Vixra.org 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.