Solving The Neutrosophic Shortest Path Problem in Triangular Fuzzy Numbers Using Metric Distance Ranking

Abstract

This paper proposes a novel approach to finding the shortest path in a directed graph, where each arc length is represented by a Neutrosophic Triangular Fuzzy Number. A systematic procedure is designed to determine the optimal path. An illustrative example is provided to demonstrate the effectiveness of the proposed approach.