Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
复制标题
DOI：
10.1007/s40747-019-0098-z
复制
发表时间：
2019-12-01
影响因子：
5.8
通讯作者：
Parimala, Mani
中科院分区：
文献类型：
--
作者：
Broumi, Said;Talea, Mohamed;Parimala, Mani
近十年来，在不确定的气氛下，人们对许多算法进行了深入研究，以解决最短路径问题。在本文中，我们将最短路径问题与各种现有算法进行了比较。最后我们得出了针对特定环境的最佳算法。
In the last decade, concealed by uncertain atmosphere, many algorithms have been studied deeply to workout the shortest path problem. In this paper, we compared the shortest path problem with various existing algorithms. Finally, we concluded the best algorithm for certain environment.