Loading...
Please wait, while we are loading the content...
Similar Documents
Pathfinding through urban traffic using Dijkstra ’ s Algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Nugraha, Tubagus Andhika |
| Copyright Year | 2011 |
| Abstract | Getting from place to place is a problem for citizens of urban cities that worsens every day due to the inevitable increase in vehicle ownership leading to more traffic on roads and the impending traffic jams that come with them. Efficient urban travel requires a route that is not only short in terms of distance, but also takes less time by avoiding the worst traffic. This paper discusses how Dijkstra’s algorithm can be used to find the optimal path for travelling inside a city. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://informatika.stei.itb.ac.id/~rinaldi.munir/Matdis/2011-2012/Makalah2011/Makalah-IF2091-2011-040.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
