Dijikstra Algorithm In Google Map By Using Fuzzy Graph

Authors

  • M. Bharath Lavanya  PG Student,Department of Mathematics, Dr. SNS Rajalakshmi College of Arts and Science(Autonomous), Coimbatore, Tamilnadu, India
  • T. Ramesh  Assistant professor, Department of Mathematics, Dr. SNS Rajalakshmi College of Arts And Science(Autonomous), Coimbatore, Tamilnadu, India

Keywords:

Fuzzy Graph, Fuzzy Tree, Fuzzy Network, Fuzzy Sub-Trees.

Abstract

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. In this paper we introduce the method of finding the shortest path in complete fuzzy graph of uncertainty by using Dijikstra algorithm. To illustrate the effectiveness of the proposed approach we compare these results with Google map and discuss the algorithm by Dijikstra which is most efficient for complete fuzzy graph for uncertainty.

References

  1. G. Nirmala & K. Uma – Shortest route algorithm for fuzzy graph, International Journal of Scientific and Research Publications, Volume 3, Issue 11, November 2013 1 ISSN 2250-3153
  2. Application of Graph Theory to find Optimal Paths for the Transportation Problem- Rame Likaja, Ahmet Shalaa and Mirlind Bruqi, International Journal of Current Engineering and Technology ISSN 2277 – 4106
  3. An application of Dijkstra's Algorithm to shortest route problem-Ojekudo, Nathaniel Akpofure (PhD) 1& Akpan, Nsikan Paul (PhD), IOSR Journal of Mathematics (IOSR-JM) e-ISSN: 2278-5728, p-ISSN: 2319-765X. Volume 13, Issue 3 Ver. 1 (May.-June. 2017), PP 20-32

Downloads

Published

2018-09-30

Issue

Section

Research Articles

How to Cite

[1]
M. Bharath Lavanya, T. Ramesh, " Dijikstra Algorithm In Google Map By Using Fuzzy Graph, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 4, Issue 10, pp.123-133, September-October-2018.