000			01556nam a22002417a 4500
003			ft6044
005			20251127125126.0
008			251127b ||||| |||| 00| 0 eng d
041			_aengtag
050			_aQA76.9 D48 2017
082			_a.
100	1		_aDanezekiel De Vera, and Marie Bernadette Famy.
245			_aAn enhancement of bellman ford algorithm applied in route calculator
264		1	_a. _b. _cc2017
300			_bUndergraduate Thesis: (BSCS major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2017.
336			_2text _atext _btext
337			_2unmediated _aunmediated _bunmediated
338			_2volume _avolume _bvolume
505			_aABSTRACT: 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			_aF
655			_aacademic writing
942			_2lcc _cARCHIVES
999			_c37234 _d37234