The Implementation Of Bellman-Ford Algorithm In Rembang Tourism Mobile Application As A Tourism Information Media

  • Eko Supraptono Universitas Negeri Semarang
  • Arief Arfriandi Universitas Negeri Semarang
  • Sulus Ilhamti Rizqian Universitas Negeri Semarang
Keywords: shortes distance, bellman-ford, tourism

Abstract

Tourism is one of the methods to publish the beauty of nature or the uniqueness of culture in a region that spreads from the coast up to the mountains. The distribution and the access to tourist attractions require mobile application. In creating the application, Bellman – Ford algorithm was used to get the shortest route. The algorithm was the Bellman – Ford algorithm which was used to calculate the shortest distance to the tourist attraction on the weighted graph. Testing the functionality of the application used a black box. The results showed that functions on the mobile application could run well. The compatibility testing showed 100% compatibility with a number of Android devices. In addition, the usability testing showed that the application was appropriate to use with percentage by 82.7% of the 30 respondents. The "Rembang tourism" mobile application can be used by users of information about tourism.

Published
2019-01-29
How to Cite
Supraptono, E., Arfriandi, A., & Rizqian, S. I. (2019). The Implementation Of Bellman-Ford Algorithm In Rembang Tourism Mobile Application As A Tourism Information Media. Data Science: Journal of Computing and Applied Informatics, 3(1), 46-56. https://doi.org/10.32734/jocai.v3.i1-679

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.