Previously, i have written this tutorial >> Implementation of dijkstra algorithm in Android in Indonesian language. But one visitor commented to me <here>. She say want to read the tutorial in English. So, today i’ll rewrite the tutorial in English.
Let’s start the tutorial !
demo app :
INTRO : CASE OF DIJKSTRA ALGORITHM (PUBLIC TRANSPORTATION)
This tutorial will be divided to some part, this part will explain the case : how to get the shortest path of public transportation route.
– This is the case :
John is ABC junior high school graduates, want to continue to favorite high school. But the location of favorite high school is very far. So, John need some public transportation. The problem is He doesn’t know what kind of public transport that should be used to quickly get to the location.
– Solution :
In the case above, John can quickly get to the location if he using the shortest path of public transportation route. This case can be solved by dijkstra algorithm. 🙂
Okay, now we’ve got a case and solution 🙂 . Then, we can create the dijkstra algorithm in android by the following part :
1) [part 2 – convert graph] https://www.youtube.com/watch?v=1LBbyvZkcJ0
2) [part 3 – working with sqlite DB] https://www.youtube.com/watch?v=pCapk8Xxxyo
3) [part 4 – create app] https://www.youtube.com/watch?v=2soi0VcNvz8