MVLSC Home • Issue Contents

Computation of Shortest Path in a Vague Network by Euclidean Distance
Abolfazl Lakdashti, S. Sahoo, R. A. Borzooei, M. Pal, Hossein Rashmanlou and Ahmad Esfandiari

Theoretical concepts of graphs are highly utilized by computer scientists. Especially in research areas of computer science such as data mining, image segmentation, clustering image capturing, networking, etc. The vague graphs are more flexible and compatible than fuzzy graphs due to the fact that they have many applications in networks. This paper presents an algorithm to find the shortest path in a directed graph whose arc length is taken as triangular vague number instead of real number. Finally, an illustrative numerical example is given to demonstrate the proposed algorithm.

AMS Mathematics Subject Classification (2010): 05C99, 05C22.

Keywords: Vague shortest path, vague number, vague graph, fuzzy set.

Full Text (IP)