Loading...
Please wait, while we are loading the content...
Similar Documents
Perbandingan Algoritma Floyd-Warshall dan Bellman-Ford dalam Pencarian Jarak Terpendek Antar ATM di Kota Tebing Tinggi
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lestari, Sasti |
| Copyright Year | 2018 |
| Abstract | The rapid development of technology enables all daily activities facilitated well. The using of ATM helps people to carry out all transactions whether for saving, making payments and others. Sometimes, the transactions conducted big amounts of money and the presence of the ATM will surely make them easier. The shortest distance searching is intended to help the user for saving time, especially if they need the nearest ATM to make some urgent transactions. The shortest trajectory issue is for finding paths between two points on a weighted graph that have combined weighted value on the graph's side that passed by the minimum number. The shortest distance searching can be done by using several algorithms such as Floyd-Warshall and Bellman-Ford Algorithms. Floyd-Warshall algorithm is one of the variants of dynamic programming, a method that solves problems by looking at the solutions to be obtained as an interrelated decision. While the Bellman-Ford Algorithm handles the searching of trajectory case with the smallest quality. In the Bellman-Ford Algorithm If there is no trajectory that connects origin dot and target dot, the result is infinity. The system implementation used C# as programming language, then the results of this research on Floyd-Warshall and Bellman-Ford Algorithms has produced the same total distance, and from the running time algorithm Floyd-Warshall was faster than the Bellman-Ford algorithm. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://repositori.usu.ac.id/bitstream/handle/123456789/6898/131401044.pdf?isAllowed=y&sequence=1 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |