Bellman Ford Algorithm for the Shortest Path Problem in a Neutrosophic Pythagorean Fuzzy Network
Advances in Neutrosophic Mathematics and Informatics · 2026 · 24-30
DOI: 10.64060/anmi1v1i4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances in Neutrosophic Mathematics and Informatics, 2026. Verfasst von Basha M Asim und 2 weiteren Autor:innen.
Abstract (Originalsprache)
The study describes a method for discovering the shortest path in networks that employs Neutrosophic Pythagorean Fuzzy Graph and Triangular Fuzzy Numbers (TFN). This method uses neutrosophic logic and Pythagorean fuzzy sets for handling ambiguous and imprecise data. The Neutrosophic Pythagorean Fuzzy Shortest Path (NPFSP) algorithm calculates the shortest path while accounting for membership functions for truth, indeterminacy, and falsity. The technique provides improved flexibility and accuracy when dealing with uncertainty.
Zitieren
APA
Asim, B. M., Mohammed, J. M., & Said, B. (2026). Bellman Ford Algorithm for the Shortest Path Problem in a Neutrosophic Pythagorean Fuzzy Network. Advances in Neutrosophic Mathematics and Informatics, 24-30. https://doi.org/10.64060/anmi1v1i4
Vancouver
Asim BM, Mohammed JM, Said B. Bellman Ford Algorithm for the Shortest Path Problem in a Neutrosophic Pythagorean Fuzzy Network. Advances in Neutrosophic Mathematics and Informatics. 2026:24-30. doi:10.64060/anmi1v1i4
BibTeX
@article{Asim2026,
author = {Asim, Basha M and Mohammed, Jabarulla M and Said, Broumi},
title = {Bellman Ford Algorithm for the Shortest Path Problem in a Neutrosophic Pythagorean Fuzzy Network},
journal = {Advances in Neutrosophic Mathematics and Informatics},
year = {2026},
pages = {24--30},
doi = {10.64060/anmi1v1i4}
}
EUVIMED