文章基本信息

标题：Application of Floyd-Warshall Iterative Algorithm for Travelling to the Most Popular Tourist Attractions in Myanmar
本地全文：下载
作者：Sanda San ; San San Maw ; Lin Lin Naing 等
期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2019
卷号：67
期号：7
页码：80-85
DOI：10.14445/22312803/IJCTT-V67I7P113
出版社：Seventh Sense Research Group
摘要：In this paper, wellknown FloydWarshall algorithm in graph theory isapplied to find the shortest path between two places. This algorithm is an AllPairsShortestPath (APSP) algorithm and can solveand optimize the efficient solution for the finding the shortest path between all pairs of vertices by taking every road as an edge and every vertex as city or country. Itmakes a table of all the distances between cities on a road map. It also uses a recursive approach to find the shortest distances and minimum time between all nodes in a graph. The goal of this paper is to find the effective ways in travelling for top seven tourists’ attraction places in Myanmar by means of optimizing both distances and time taken between every pair of places using Floyd Warshall iterative algorithm.
关键词：Shortest path; Floyd-Warshall; distance matrix and node sequence matrix; iterative algorithm; tourism