Journal ArticleOPEN ACCESS

Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview

Complex and Intelligent Systems (2019) 5(4) 371-378
DOI: 10.1007/s40747-019-0098-z
69Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Broumi, S., Talea, M., Bakali, A., Smarandache, F., Nagarajan, D., Lathamaheswari, M., & Parimala, M. (2019). Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview. Complex and Intelligent Systems, 5(4), 371–378. https://doi.org/10.1007/s40747-019-0098-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free