Metode Depth First Search untuk Pencarian Rute Jadwal Penerbangan

Abstract

Increasing the number of passanger over the year resulted many avation company. That is why the use of aircraft most widely used. However there is an obstacle if the passanger had to go to the destination where there is no airlines serving the directly route to destination so that the passanger have to looking for other airlines. In this study explains about how to analyze the Dept First Search (DFS) algorithm to determine the fastest flight route with the best cost and time. The DFS algorithm will search all possible that may occur from the available data of flight route then the result of all searches will be compared to get the fastest flight route. This study uses data of Indonesian flight schedule. The result of this paper is a desktop-based to retrieval system of flight schedule using visual basic programming language that can display flight schedule with the best cost and time.