Pagini recente » Diferente pentru algoritmiada-2011/runda-1/5-9 intre reviziile 5 si 2 | Multiplu2 | Diferente pentru blog/buguri-frecvente intre reviziile 26 si 11 | Diferente pentru utilizator/mihaistamatescu intre reviziile 33 si 32 | 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.
