Ardi Visualisasi dan Penelusuran Relasi Jabatan Akademik Menggunakan Algoritma Breadth First Search Berbasis Web

Zahra febrianti putri; Ardi Wijaya

doi:10.33998/processor.2026.21.1.2741

Authors

Zahra febrianti putri Universitas Muhammadiyah Bengkulu
Ardi Wijaya Universitas Muhammadiyah Bengkulu

DOI:

https://doi.org/10.33998/processor.2026.21.1.2741

Abstract

This study implements the Breadth First Search (BFS) algorithm to visualize university organizational structures, simplifying the tracing of command lines. The primary issue is the difficulty of understanding position relationships in complex static charts. Utilizing the CodeIgniter 4 framework, the BFS algorithm is applied to process hierarchical data level-by-level from a relational database. The results demonstrate that the integration of BFS and pathfinding functions successfully identifies the shortest coordination paths accurately. The system dynamically isolates and highlights the path from top leadership to the target position. This study concludes that BFS effectively improves bureaucratic tracing efficiency and simplifies the understanding of organizational relationships through interactive visualization.

Downloads

Download data is not yet available.

References

A. Latifurrahman and A. Salam, “Sistem Informasi Akademik menggunakan PHP dan MySQL pada Sekolah Tinggi Manajemen Informatika Komputer ( STMIK ) Indonesia Banda Aceh Abstrak,” J. Sist. Komput., vol. 3, no. 2, pp. 74–83, 2023, doi: https://doi.org/10.35870/siskom.v3i2.796.

R. Wahyudi, M. Iqbal, and L. D. Oktaviana, “RECORDING DAN PENCARIAN SILSILAH KAMBING PERAH MENGGUNAKAN RECORDING AND SEARCHING FOR PEDIGREE DAIRY GOAT USING DEPTH,” J. Teknol. Inf. dan Ilmu Komput., vol. 9, no. 1, pp. 1–10, 2022, doi: https://doi.org/10.25126/jtiik.202293349.

A. Suswiantara, N. Dzakhwan, and A. Fahruddin, “Application of the Best First Search ( BFS ) Algorithm for Determining Parking Slots Penerapan Algoritma Best First Search ( BFS ) untuk Penentuan Slot Parkir,” Indones. J. Mach. Learn. Comput. Sci., vol. 4, no. October, pp. 1606–1613, 2024, doi: https://doi.org/10.57152/malcom.v4i4.1541.

A. Sellyana and N. B. Nugraha, “APLIKASI PENDISTRIBUSIAN BARANG J & T DUMAI BERBASIS MOBILE MENGGUNAKAN ALGORITMA,” J. Mahajana Inf., vol. 6, no. 1, 2021, doi: https://doi.org/10.51544/jurnalmi.v6i1.1978.

A. P. Mardiono, M. A. Rosid, and S. Busono, “Rancang bangun sistem informasi silsilah keluarga berbasis website menggunakan metode rapid appli- cation development (rad),” J. Ilm. Penelit. dan Pembelajaran Inform., vol. 9, no. 4, pp. 1869–1880, 2024, doi: https://doi.org/10.29100/jipi.v9i4.5516.

K. K. A. Setiawan, F. Natsir, and S. Julaeha, “IMPLEMENTASI TEXT MINING PADA SILSILAH KELUARGA MENGGUNAKAN METODE DECISION TREE,” J. Mhs. Tek. Inform., vol. 8, no. 6, pp. 12760–12766, 2024, doi: https://doi.org/10.36040/jati.v8i6.11814.

L. M. F. Aksara, “PERANCANGAN WEBSITE SISTEM INFORMASI JADWAL MENGGUNAKAN METODE WATERFALL,” J. Sist. Inf. dan Sist. Komput., vol. 9, no. 1, pp. 23–35, 2024, doi: https://doi.org/10.51717/simkom.v9i1.353.

F. R. Nufaily and M. U. Siregar, “Analisis Ketertarikan Pengguna Microsoft Excel Online untuk Pengolahan Data Silsilah Keluarga Menggunakan TAM dan TPB,” J. Inform. Sunan Kalijaga, vol. 10, no. 3, pp. 279–293, 2025, doi: https://doi.org/10.14421/jiska.2025.10.3.279-293.

F. Al Ayubi and A. D. Indriyanti, “Perancangan Sistem Pakar untuk Mendiagnosis Kelainan pada Ibu Hamil menggunakan Metode Breadth First Search,” J. Emerg. Inf. Syst. Bus. Intell., vol. 03, no. 01, pp. 18–26, 2022, doi: https://doi.org/10.26740/jeisbi.v3i1.44118.

A. N. Zabar, R. A. Krisdiawan, and N. A. Asikin, “Implementasi Algoritma Breadth First Search untuk Pencarian Solusi Pada Game Slide Puzzle Pengenalan Hewan,” J. MEDIA Inform. [JUMIN], vol. 6, no. 4, pp. 2390–2400, 2025, doi: https://doi.org/10.55338/jumin.v6i4.6348.

Suryani, Nurdiansah, Faizal, Nasaruddin, and S. Alam, “Implementasi Algoritma BFS pada Desain Sistem Pengolahan Temu Kembali Berkas,” Ris. dan E-Jurnal Manaj. Inform. Komput., vol. 7, pp. 675–685, 2023, doi: https://doi.org/10.33395/remik.v7i1.12086.

H. Sujaini, A. Perwitasari, and T. Januardi, “Sistem Pembelajaran Algoritma Best First Search,Breadth First Search & Depth First Search,” J. Tek. Indones., vol. 2, no. April, pp. 65–78, 2023, doi: https://doi.org/10.58860/jti.v2i2.15.

D. A. Andriati, E. Dariato, and R. Hafizh, “Implementasi Teori Graf dan Optimisasi Alogaritma Dijkstra , BFS dan DFS Dalam Menentukan Rute Terpendek Jaringan Bengkel di Jakarta Berbasis Google Maps,” J. Multimed. Dan Teknol. Inf., vol. 07, no. 03, pp. 674–684, 2025, doi: https://doi.org/10.54209/jatilima.v7i03.1654.

S. N. Rizki, Y. Yenni, and N. Jarti, “Perancangan Aplikasi Sistem Informasi Wisata Menggunakan Metode Algoritma Best First Search,” J. Bin. Digit. Technol., vol. 7, no. 2, 2024, doi: https://doi.org/10.32877/bt.v7i2.1845.

A. Muhardono, “Penerapan Algoritma Breadth First Search dan Depth First Search pada Game Angka,” J. Minfo Polgan, vol. 12, pp. 171–182, 2023, doi: https://doi.org/10.33395/jmp.v12i1.12340.

H. D. Hutahaean, “PENERAPAN METODE BEST FIRST SEARCH PADA PERMAINAN TIC TAC TOE,” J. Comput. Networks , Archit. High Perform. Comput., vol. 1, no. 1, pp. 10–15, 2019, doi: https://doi.org/10.47709/cnapc.v1i1.3.

M. Tumbade and E. Sediyono, “Penerapan Breadth-first Search ( BFS ) Pada Perancangan Website Sistem Informasi Struktur Marga Kabupaten Pegunungan Bintang,” J. Pekommas, pp. 39–46, 2023, doi: https://doi.org/10.56873/jpkm.v8i1.4964.

H. D. W, I. Nugroho, and R. Siahaan, “Aplikasi Silsilah Marga Siahaan ( Somba Debata ) Berbasis Android,” J. Ilm. STMIK AUB, vol. 27, no. 1, pp. 85–96, 2021, doi: https://doi.org/10.36309/goi.v27i1.147.