Shortest Path Problem Under Interval Valued Neutrosophic Setting

This paper presents a study of neutrosophic shortestpath with interval valued neutrosophic number on a network. Aproposed algorithm also gives the shortest path length usingranking function from source node to destination node. Hereeach arc length is assigned to interval valued neutrosophicnumber. Finally, a numerical example has been provided forillustrating the proposed approach.