Pagini recente » bruh | bolt | monopoly | Diferente pentru problema/parcele intre reviziile 11 si 4 | Diferente pentru blog/numbers-everyone-should-know intre reviziile 33 si 34
Nu exista diferente intre titluri.
Diferente intre continut:
| #directed edges | 42 199 587 | 47 244 849 | 58 213 192 |
| #road categories | 13 | 13 | 4 |
Since we chose half a second to be our execution time and the size of our problem to be about 20 million edges it's clear from our table that m log n is too slow. So pure Dijkstra won't do. We need to look at how other algorithms like A star search or one based on 'Highway hierarchies':http://algo2.iti.kit.edu/schultes/hwy/esa06HwyHierarchies.pdf behave for this problem.
Since we chose half a second to be our execution time and the size of our problem to be about 40 million edges it's clear from our table that m log n is too slow. So pure Dijkstra won't do. We need to look at how other algorithms like A star search or one based on 'Highway hierarchies':http://algo2.iti.kit.edu/schultes/hwy/esa06HwyHierarchies.pdf behave for this problem.
Diferente intre securitate:
Topicul de forum nu a fost schimbat.
