Graph Application in Finding the fastest Path From Subang City To Cirebon City
Abstract
This paper discusses the application of one of the Discrete Mathematics materials, namely Graph Theory, in determining the fastest route from Subang City, more precisely from Subang Pusakanagara, Subang to Cirebon City. The fastest path is the route taken by considering the minimum travel time from one place to another. There are various ways to determine the minimum travel path, but the goal is the same, namely to find a travel path with the minimum travel time. The research process begins with formulating a problem using Graph Theory with the help of the Google Maps application and the experiences of the researchers. This Google Maps application is very useful when traveling long distances but want to use the path with minimal travel time. After formulating the problem, it is continued with the implementation of the Weighted Average Method and ends with the Floyd Warshall Algorithm. The result of this study is to find the fastest path from the starting point, namely Subang Pusakanagara to the end point, namely Cirebon City.
Downloads
References
[2] N. Rio, “Aplikasi Graf Berbobot dalam Menentukan Jalur Angkot ( Angkutan Kota ) Tercepat,†Inform. Bandung, pp. 1–5, 2011.
[3] N. Citra and W. Eka, “Aplikasi Teori Graf dalam Menentukan Jalur Tercepat Mitigasi Gunung Merapi Zona 1,†J. Ilm. Mat., vol. 7, no. 2, pp. 88–95, 2020, doi: 10.26555/konvergensi.v7i2.19610.
[4] E. R. Onainor, “Landasan Teori Graf,†vol. 1, pp. 105–112, 2019.
[5] E. Kusuma and H. Agung, “Aplikasi Perhitungan Dan Visualisasi Jarak Terpendek Berdasarkan Data Coordinate Dengan Algoritma Dijkstra Dalam Kasus Pengantaran Barang Di Kawasan Jabodetabek,†J. SISFOKOM, vol. 08, no. 1, pp. 14–23, 2019.
[6] I. Amal, “Penerapan Graf Dalam Penentuan Jalur Terpendek Untuk Berkeliling Sekretariat Himpunan,†Inform. Bandung, 2013.
[7] R. Munir, Matematika Disktrit. Bandung, 2010.
[8] E. N. Hayati and A. Yohanes, “Pencarian Rute Terpendek Menggunakan Algoritma Greedy,†Semin. Nas. IENACO, pp. 391–397, 2014.
[9] R. Paryanti and T. Aris, “Penerapan Teori Graf untuk Mencari Lintasan Tercepat Bus Trans-Jogja,†vol. 20, pp. 1–9, 2011.
[10] A. F. Sani, N. K. T. Tastrawati, and I. M. E. Dwipawana, “Algoritma Floyd Warshall Untuk Menentukan Jalur Terpendek Evakuasi Tsunami Di Kelurahan Sanur,†E-Jurnal Mat., vol. 2, no. 1, pp. 1–5, 2013, doi: 10.24843/mtk.2013.v02.i01.p020.
