COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS

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.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.