Floyd-Warshall Algorithm Based on Picture Fuzzy Information.

The Floyd-Warshall algorithm is frequently used to determine the shortest path between any pair of nodes. It works well for crisp weights, but the problem arises when weights are vague and uncertain. Let us take an example of computer networks, where the chosen path might no longer be appropriate due to rapid changes in network conditions. The optimal path from among all possible courses is chosen in computer networks based on a variety of parameters. In this paper, we design a new variant of the Floyd-Warshall algorithm that identifies an All-Pair Shortest Path (APSP) in an uncertain situation of a network. In the proposed methodology, multiple criteria and their mutual association may involve the selection of any suitable path between any two node points, and the values of these criteria may change due to an uncertain environment. We use trapezoidal picture fuzzy addition, score, and accuracy functions to find APSP. We compute the time complexity of this algorithm and contrast it with the traditional Floyd-Warshall algorithm and fuzzy Floyd-Warshall algorithm. [ABSTRACT FROM AUTHOR]