NSPP: A Novel algorithm for neutrosophic shortest path problem

In current decade the researchers addressed uncertainty issues. It becomes major issues in case of an effective shortest path in the given network system. This work tried to introduce a mathematical model to characterize the uncertainty in network based on truth, falsity and indeterminacy using interval-valued membership values. The motive is to provide an improved algorithm for shortest path problem. The distance among one node to another node is ranked using interval-valued neutrosophic membership-values. A comparison of our proposed algorithm with that of existing approaches is also established which shows the advantages of new algorithm over the existing ones.