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...
Gorde:
| Egile nagusia: | |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
State Islamic University Sunan Kalijaga
2019-01-01
|
| Saila: | IJID (International Journal on Informatics for Development) |
| Gaiak: | |
| Sarrera elektronikoa: | https://ejournal.uin-suka.ac.id/saintek/ijid/article/view/1332 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|