Description of Students Thinking on Warshall-Floyd Algorithm

Zaini Zaini


The shortest path continues to be a trend until now that is always discussed and developed. This study focuses on the construction process and description of the students' understanding in deciding the shortest route based on the matrix iteration according to the Floyd-Warshall algorithm. The research approach used is descriptive qualitative research and the data collection technique is a test technique. The research data included problem-solving by four students with different abilities and the result data were analyzed inductively. The results showed that the matrix iteration with the formula for determining the entry of the iteration matrix xn = minimum(dijk-1, dikk-1 + dkjk-1) was followed without any constraints by all students until the 7th iteration. It was found that the inaccuracy of taking entries in the 1st iteration by students with low ability caused calculation errors and failure in finding the shortest route.

Full Text:



Attamimi, I., Yahya, W. and Hanfi, Hannats, M. (2017). Analisis Perbandingan Algoritma Floyd-Warshall dan Dijkstra untuk Menentukan Jalur Terpendek Pada Jaringan Openflow. Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer (J-PTIIK), 1(12), 1842–1849.

Dermawan, T. S. (2018). Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train. International Journal on Informatics for Development (IJID), 7(2), 8. doi: 10.14421/ijid.2018.07202.

Felipe, A. L., Pham, T. C. and Amouroux, E. (2017). Interdisciplinary Collaborative Teaching in Project-Based Learning Approach. in Integrated Engineering. Sydney: Australasian Association for Engineering Education (AEEE), 1–8.

Husni Al Amin, I.,Lusiana,V.,Hartono,B. (2017). Visualisasi Pencarian Lintasan Terpendek Algoritma Floyd-Warshall dan Dijkstra Menggunakan TEX. in Prosiding SINTAK, 17–23.

Kriswanto, Y. R., Bendi, R. K. and Aliyanto, A. (2014). Penentuan Jarak Terpendek Rute Transmusi dengan Algoritma Floyd-Warshall. Seminar Nasional Teknologi Informasi & Komunikasi Terapan, 209–216. doi: 10.13140/2.1.2632.6729.

Magzhan, K. and Jani, H. (2013). A Review And Evaluations Of Shortest Path Algorithms. International Journal of Scientific & Technology Research, 2(6), 99–104. Available at:

Marlina, L. (2017). Penerapan Algoritma Dijkstra dan Floyd-Warshall untuk Menentukan Rute Terpendek Tempat Wisata Di Batang. Universitas Negeri Semarang.

Mills, E. J. and Treagust, F. D. (2003). Engineering Education - Is Problem Based Or Project Based Learning The Answer?. Australasian Journal Of Engineering Education, 3(2), 2–16.

Novandi, R. A. D. (2007). Perbandingan Algoritma Dijkstra dan Algoritma Floyd-Warshall dalam Penentuan Lintasan Terpendek ( Single Pair Shortest Path ). Strategi Algoritmik. Available at:

Putro, E. P. and Darminto, B. P. (2015). Analisis Kesalahan Dalam Menyelesaikan Soal Ujian Akhir Semester Statistika Dasar Pada Mahasiswa Program Studi Pendidikan Matematika. Ekuivalen, 18(1), 63–68.

Ramadiani., Bukhori, D.,Azainil., and Dengen, N. (2018). Floyd-warshall algorithm to determine the shortest path based on android. IOP Conference Series: Earth and Environmental Science, 144(1). doi: 10.1088/1755-1315/144/1/012019.

Yao, B., Yin, J., Zhou, H., and Wu, Wei. (2016). Path Optimization Algorithms Based on Graph Theory. International Journal of Grid and Distributed Computing, 9(6), 137–148.



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.




Published by:

Institute of Managing and Publishing of Scientific Journals STKIP Singkawang

International Journal of Multi Disipline Science (IJ-MDS)

e-ISSN : 2615-1707

Sekolah Tinggi Keguruan dan Ilmu Pendidikan (STKIP) SIngkawang

Address : STKIP SIngkawang, Jalan STKIP - Kelurahan Naram Singkawang, Kalimantan Barat, INDONESIA, 79251
No. Telp.   : +62562 420 0344
No. Fax.    : +62562 420 0584

Email Cordinator: [email protected] / [email protected] /Wa : +6282142072788

Plagiarism Tools


  Creative Commons License

International Journal of Multi Disipline Science (IJ-MDS)is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.