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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
