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 shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.
single valued triangular neutrosophic number; score function function; network network; shortest shortest path problem
Smarandache, Florentin; Said Broumi; Assia Bakali; and Mohamed Talea. "COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS." (2017): 1-25. doi:http://doi.org/10.5281/zenodo.888858.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.