A New Network shortest path algorithm via Neutrosophic support digraph

Abstract

In the literature, there have been several studies and introductions of fuzzy set extension and generalisation. A extension of the intuitionistic fuzzy set and fuzzy graph is the neutrosophic support digraph. The neutrosophic support graph is referred to as neutrosophic support digraph in this study since several fundamental operations are redefined (in short NSDG). NSDG is discussed in terms of mathematical operations and relationships. We also developed a scoring function-based approach to solving the shortest route issue.