Simulation of the BFS Algorithm for Determining the Shortest Route to Sawarna Beach, Banten Province

Sawarna Beach, located in Lebak Regency, Banten Province, is a popular tourist destination. However, limited information and poor accessibility remain challenges for potential visitors. Many rely solely on general mapping services, which may not reflect the most efficient routes. This study aims to simulate the Breadth First Search (BFS) algorithm to determine the shortest travel route to Sawarna Beach. The BFS algorithm, effective for unweighted graphs, explores all vertices level by level. A simulation-based quantitative method was employed, and the system was implemented using PHP. The results reveal multiple alternative routes that could serve as references for travelers unfamiliar with the area. While shortest routes were identified, travelers are advised to consider additional factors such as traffic, road conditions, and available facilities.

Authors

Institutions

Publication Details

Journal
Jurnal Penelitian Pendidikan IPA
Published
2025-05-25
DOI
https://doi.org/10.29303/jppipa.v11i5.11001
Primary Topic
Decision Support System Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Simulation of the BFS Algorithm for Determining the Shortest Route to Sawarna Beach, Banten Province

Iis Nurasiah, Sigit Auliana, Mochammad Darip, Basuki Rakhim Setya Permana
Jurnal Penelitian Pendidikan IPA
Decision Support System Applications
article

Simulation of the BFS Algorithm for Determining the Shortest Route to Sawarna Beach, Banten Province

Iis Nurasiah, Sigit Auliana, Mochammad Darip, Basuki Rakhim Setya Permana
article en

Abstract

Sawarna Beach, located in Lebak Regency, Banten Province, is a popular tourist destination. However, limited information and poor accessibility remain challenges for potential visitors. Many rely solely on general mapping services, which may not reflect the most efficient routes. This study aims to simulate the Breadth First Search (BFS) algorithm to determine the shortest travel route to Sawarna Beach. The BFS algorithm, effective for unweighted graphs, explores all vertices level by level. A simulation-based quantitative method was employed, and the system was implemented using PHP. The results reveal multiple alternative routes that could serve as references for travelers unfamiliar with the area. While shortest routes were identified, travelers are advised to consider additional factors such as traffic, road conditions, and available facilities.

Jurnal Penelitian Pendidikan IPAVol. 11(5)
Universitas Nusa Bangsa (ID)
Openalex Percentile: Top 74%
Decision Support System Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.