| 000 -LEADER |
|---|
| fixed length control field |
01556nam a22002417a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
ft6044 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20251127125126.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
251127b ||||| |||| 00| 0 eng d |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
engtag |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.9 D48 2017 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
. |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Danezekiel De Vera, and Marie Bernadette Famy. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
An enhancement of bellman ford algorithm applied in route calculator |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
. |
| Name of producer, publisher, distributor, manufacturer |
. |
| Date of production, publication, distribution, manufacture, or copyright notice |
c2017 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Other physical details |
Undergraduate Thesis: (BSCS major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2017. |
| 336 ## - CONTENT TYPE |
|---|
| Source |
text |
| Content type term |
text |
| Content type code |
text |
| 337 ## - MEDIA TYPE |
|---|
| Source |
unmediated |
| Media type term |
unmediated |
| Media type code |
unmediated |
| 338 ## - CARRIER TYPE |
|---|
| Source |
volume |
| Carrier type term |
volume |
| Carrier type code |
volume |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
ABSTRACT: Bellman-Ford algorithm applied in Route Calculation is an effective tool and is used by traffic and navigation app. The Bellman-Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all the other vertices in a weighted digraph. However, Bellma-Fords’s Algorithm loses efficiency by overcoming negative weight cycle, slower because it continues to iterate the edges until the last iteration is complete and suffers count-to-infinity problem. In this study, we proposed the enhanced algorithm by lessening the time in computing the optimized path and by recognizing the direction of the paths to avoid the existing algorithm to suffer count-to-infinity problem. This said methods is essential to produce a more efficient and optimized output than the existing algorithm. |
| 526 ## - STUDY PROGRAM INFORMATION NOTE |
|---|
| Classification |
Filipiniana |
| 655 ## - INDEX TERM--GENRE/FORM |
|---|
| Genre/form data or focus term |
academic writing |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Archival materials |