Journal article Open Access

Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information

Said Broumi; Assia Bakali; Mohamed Talea; Florentin Smarandache

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the
shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.

Files (618.3 kB)
Name Size
ShortestPathProblemUnderTriangular.pdf md5:770ef19e71b351be57332015cd535320 618.3 kB Download

Share

Cite as