Neutrosophic Pythagorean Fuzzy Shortest Path in a Network

We began a novel technique to dealing with the Neutrosophic Pythagorean shortest route problem in a network in this paper by representing each edge weight as a triangular fuzzy Pythagorean number with dependent Neutrosophic components and Pythagorean fuzzy graph condition.0≤μ_1 (v_i^' )^2+β_1 (v_i^' )^2+σ_1 (v_i^' )^2≤2. The main purpose of this article is to show how to use Neutrosophic Pythagorean fuzzy graphs. As a result, we created the proposed method, which also delivers the shortest path length from the source node (SN) to the destination node by using a ranking function for the Neutrosophic Pythagorean fuzzy Triangular number. Finally, an illustrative instance is supplied for validation.