• Dr.V.Jeyanthi
• Mrs.Radhika V.S
• Mrs.Sreeja T. S

Shortest path problem is one of the most important and well-known problem that appears in various fields of science, engineering etc. The main objective of the shortest path problem is to find a path with minimum length or cost between any two vertices. The edge length of the network may represent many real life situations which includes uncertainity, incompleteness, indeterminate and inconsistent information in the real world. To deal with all these real life situations we use the concept of neutrosophic sets and logic. But in real life situations we are not certain about the quantities used. There may exist uncertainity always. Here in this paper we are proposing a neutrosophic network method for finding the shortest path between the nodes using single valued trapezoidal neutrosophic numbers.

Floyd’s algorithm, single valued trapezoidal neutrosophic number, shortest path problem.

"A new algorithm for solving single valued Trapezoidal Neutrosophic Shortest Path Problems ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.152-172, June-2019, Available :http://www.jetir.org/papers/JETIR190552J.pdf

"A new algorithm for solving single valued Trapezoidal Neutrosophic Shortest Path Problems ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp152-172, June-2019, Available at : http://www.jetir.org/papers/JETIR190552J.pdf