Danezekiel De Vera, and Marie Bernadette Famy. <br/><br/>
An enhancement of bellman ford algorithm applied in route calculator 

 -  Undergraduate Thesis: (BSCS major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2017. 
<br/><br/>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. 
<br/><br/>
<br/><br/><label>Index Terms--Genre/Form: </label><br/>academic writing
<br/><br/><label>LC Class. No.: </label>QA76.9 D48 2017 
<br/><br/><label>Dewey Class. No.: </label>