| 000 | 02591nam a2200301 i 4500 | ||
|---|---|---|---|
| 003 | CSPC | ||
| 005 | 20250814104515.0 | ||
| 008 | 250814s2024 ph a b 000 0 eng d | ||
| 040 |
_aCSPC _beng _cCSPC _erda |
||
| 090 | _aUTH BSCS C496r 2024 | ||
| 100 | 1 |
_aCiron, Laika _eauthor. |
|
| 245 | 1 | 0 |
_aRoom finder map in Nabua national high school (nnhs) using dijkstra's short path algorithm / _cLaika Ciron, Kimberly Ann S. Mangampo, and Angela Mae F. Edioma |
| 300 | _a107 leaves. | ||
| 336 |
_2rdacontent _atext |
||
| 337 |
_2rdamedia _aunmediated |
||
| 338 |
_2rdacarrier _avolume |
||
| 502 |
_aUndergraduate Thesis (BSCS) - Computer Science
_cCamarines Sur Polytechnic Colleges, 2024 |
||
| 504 | _aIncludes bibliographic references. | ||
| 520 | 3 | _aThis study was to enhance navigation by facilitating swifter and more effective travel to desired destinations. The main objective of this study was to find the shortest path in the Nabua National High School 2D room finder map to assist both students and visitors in navigating the campus efficiently. This study aimed to design a room finder from the NNHS campus map, implement dijkstra's short path algorithm in the designed room finder map of nodes and edges, and evaluate the MSE of the room finder map with the implemented algorithm of predicted shortest path distances. Constructive research design for the Room Finder Map at Nabua National High School adopted a construction approach, strategically aligning methodologies, tools, and techniques with overarching objectives. The JSON file served as the backbone of this system, representing the school's layout as a network of nodes and routes. Each node corresponded to a specific location, such as a building or key point of interest, and contained essential attributes like coordinates (x, y), labels, and asso-ciated rooms. The results highlighted that the algorithm successfully identified the shortest path in every tested scenario to evaluating the MSE with 0% percent, confirming its effec-tiveness in navigating Nabua National High School campus. The successful application of Dijkstra's algorithm confirmed its effectiveness in accurately identifying the shortest path between buildings. | |
| 700 | 1 |
_aMangampo, Kimberly Ann S. _eauthor. |
|
| 700 | 1 |
_aEdioma, Angela Mae F. _eauthor. |
|
| 720 |
_aFortuno, Kaela Marie N. _eadviser. |
||
| 720 |
_aBenitez, Ian P. _echair, panelist. |
||
| 720 |
_aPandes, Tiffany Lyn O. _epanelist. |
||
| 720 |
_aOnesa, Rosel O. _epanelist. |
||
| 942 |
_2ddc _n0 _cUM _hC496r _iBSCS _kUTH _m2024 |
||
| 999 |
_c30013 _d30013 |
||