Public Article
-
verified
Application of Pentagonal Neutrosophic Number in Shortest Path Problem
ISSN: 2690 - 6805Publisher: author   
Application of Pentagonal Neutrosophic Number in Shortest Path Problem
Indexed in
Mathematics and Statistics
ARTICLE-FACTOR
1.3
Article Basics Score: 2
Article Transparency Score: 3
Article Operation Score: 3
Article Articles Score: 2
Article Accessibility Score: 2
SUBMIT PAPER ASK QUESTION
International Category Code (ICC):
ICC-1102
Publisher: International Journal Of Neutrosophic Science Broumi Said
International Journal Address (IAA):
IAA.ZONE/269049986805
eISSN
:
2690 - 6805
VALID
ISSN Validator
Abstract
Real-human kind issues have distinct sort of ambiguity and among them; one of the critical troubles is solving the shortest path problem. In this contribution, we applied the developed score function and accuracy function of pentagonal neutrosophic number (PNN) into a shortage path selection problem. Further, a time dependent and heuristic cost function related shortest path algorithm is considered here in PNN area and solved it utilizing an influx of dissimilar rational & pioneer thinking. Lastly, estimation of total ideal time of the graph reflects the importance of this noble work.