Results for Exercise Sheet 1 (OSM file -> graph)
Add your row to the table below, following the examples already there. LCC refers to the largest connected components. In columns 4 - 6 enter the averages (= total / number of queries) for the execution time of Dijkstra's algorithm in seconds (precision: two digits after the fraction point), number of nodes settled, and cost of the shortest path in seconds. If possible, provide the figures for columns 2 - 6 for both Saarland and BaWü (separately). Last two columns as usual, see the result table for Exercise Sheet 1.
Name |
#nodes LCC |
#arcs LCC |
av. query time |
av. #settled |
av. SP cost |
Processor / RAM |
Language |
Example |
1,111,111 / 11,111,111 |
1,111,111 / 11,111,111 |
1.11 / 11.11 |
111,111 / 1,111,111 |
11,1111 / 111,111 |
|
C++ |