Shortest path problem under interval valued neutrosophic setting
Üst veriTüm öğe kaydını göster
This paper provides a research of the shortest neutrosophic path with interval valued neutrosophic numbers on a network. The suggested algorithm also provides the shortest path length utilizing ranking function from the source node to the destination node. Each of the arc lengths is attributed to an interval valued neutrosophic number. Lastly, we provide a numerical example to illustrate the suggested approach. © 2019, World Academy of Research in Science and Engineering. All rights reserved.
KaynakInternational Journal of Advanced Trends in Computer Science and Engineering