IMPLEMENTASI BELLMAN-FORD DAN FLOYD-WARSHALL DALAM MENENTUKAN JALUR TERPENDEK MENUJU UNIVERSITAS NASIONAL BERBASIS ANDROID

Abstract

Around the University of Nasional has various types of public transportation. Most of the people and University of Nasional students still use public transportation such as trains and transjakarta, but are still constrained by the distance between the station and bus stop to the University of Nasional. This study applies the Bellman-Ford and Floyd-Warshall algorithms which are considered effective and have been widely used in previous studies in the search for the shortest path, including delivery of goods, campus searches and search for travel locations. This study aims to make it easier for the community, especially students or new students to find the closest route from the station and bus stop to the University of Nasional. This study was designed using the flutter framework and the Android-based dart programming language with the most users at this time. Based on the test results, the Bellman-Ford and Floyd-Warshall algorithms for the case of finding the shortest distance from the Pasar Minggu station obtained the shortest distance of 1.54 km with an effectiveness level of 39.40%, while the case of finding the shortest distance from the Jatipadang bus stop obtained the shortest distance of 1.97 km with distance effectiveness level of 25.24%.