- Uluslararası Yönetim Bilişim Sistemleri ve Bilgisayar Bilimleri Dergisi
- Vol: 3 Issue: 2
- COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS
COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS
Authors : Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache
Pages : 41-51
Doi:10.33461/uybisbbd.588290
View : 15 | Download : 5
Publication Date : 2019-12-29
Article Type : Research
Abstract :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 also presented to illustrate the efficiency of the proposed approach.Keywords : single valued triangular neutrosophic number, , network, shortest path problem.