Table of Contents Author Guidelines Submit a Manuscript
Applied Computational Intelligence and Soft Computing
Volume 2013, Article ID 970197, 5 pages
Research Article

An Algorithm for Extracting Intuitionistic Fuzzy Shortest Path in a Graph

Department of Computer Engineering, Faculty of Engineering & Technology, Jamia Millia Islamia, New Delhi 110025, India

Received 15 September 2013; Accepted 5 October 2013

Academic Editor: Baoding Liu

Copyright © 2013 Siddhartha Sankar Biswas et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.