To calculate the best route between two addresses we can use Dijkstra's algorithm. Combined with a Fibonacci Heap we get a nice big O of O(|E| + |V| log |V|). However on big maps this turns out to be too slow. How are we supposed to make an algorithm with yields the optimal route 1000x faster? One of the solutions is smart preprocessing of map data, Highway Node routing is an application of this.
| From | 12 Mar, 2019, 12:15 |
|---|---|
| Until | 12 Mar, 2019, 13:15 |
| Location | MERC 00.28 |
| Organisers | Partner Committee |
| Login | |
|
You have to log in before you can register for this event. |