Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics
Branch Mathematics and Statistics Faculty and Staff Publications
Articles 1 - 1 of 1
Full-Text Articles in Other Mathematics
Interval Valued Neutrosophic Shortest Path Problem By A* Algorithm, Florentin Smarandache, S. Khrisna Prabha, Said Broumi
Interval Valued Neutrosophic Shortest Path Problem By A* Algorithm, Florentin Smarandache, S. Khrisna Prabha, Said Broumi
Branch Mathematics and Statistics Faculty and Staff Publications
Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path …