It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Due to the tremendous development in the field of computer and software sciences, the theory of graphics has spread widely and quickly, even becoming one of the most important sciences that played a large role in solving many problems of many diverse applications. These applications include computer protocols, Google Maps, games and more. Many researches have discussed shortest path algorithms to solve the shortest path problem in these applications. In this study, a very popular algorithms called Dijkstra algorithm and Bellman-Ford algorithm are used to make a comparison between them on the basis of complexity and performance in terms of shortest path optimization. Our results show that Dijkstra is better than the Bellman-Ford interms of execution time and more efficient for solving the shortest path issue, but the algorithm of Dijkstra work with non-negative edge weights.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details
1 Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, Parit Raja, 86400 Johor, Malaysia.
2 Department of Engineering R&D, SENA Traffic Systems Sdn. Bhd., Kuala Lumpur, Malaysia.