An Algorithm for Extracting Intuitionistic Fuzzy Shortest Path in a Graph

الملخص EN

We consider an intuitionistic fuzzy shortest path problem (IFSPP) in a directed graph where the weights of the links are intuitionistic fuzzy numbers.

We develop a method to search for an intuitionistic fuzzy shortest path from a source node to a destination node.

We coin the concept of classical Dijkstra’s algorithm which is applicable to graphs with crisp weights and then extend this concept to graphs where the weights of the arcs are intuitionistic fuzzy numbers.

It is claimed that the method may play a major role in many application areas of computer science, communication network, transportation systems, and so forth.

in particular to those networks for which the link weights (costs) are ill defined.