Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train
This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The best route is the path, which has the minimum price of a train journey. The results of route discovery will be displayed in a web-based application using the PHP progr...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
State Islamic University Sunan Kalijaga
2019-01-01
|
| Edice: | IJID (International Journal on Informatics for Development) |
| Témata: | |
| On-line přístup: | https://ejournal.uin-suka.ac.id/saintek/ijid/article/view/1332 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|