Shortest Path Problem under Pythagorean Fuzzy Network Using Dijkstra’s Algorithm
M. Mohammed Jabarulla, M. Asim Basha
Source record
Source: Crossref
Published: Sep 21, 2024
DOI: 10.9734/arjom/2024/v20i10844
Open original source ↗Source abstract
In this article investigates the Shortest Path Problem (SPP) in uncertain settings using Pythagorean fuzzy numbers (PFNs). A heuristic methodology using modified Dijkstra's algorithm is developed to exploit error, uncertainty, and partial truth for a low-cost solution. The method calculates minimum distance between starting and destination nodes and evaluates its effectiveness. Pythagorean fuzzy graphs can handle ambiguous situations.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.