Results for Exercise Sheet 9 (Public Transportation Networks, GTFS)
Add your row to the table below, following the examples already there. In the second column, put the number of stations / nodes / arcs in your time-expanded graph. In the third column, put the time for constructing the graph (including the parsing and all). In the fourth column put the average query time in milliseconds (rounded to the next integer). In the fifth column put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for Exercise Sheet 1, Exercise Sheet 2, Exercise Sheet 3, Exercise Sheet 4, Exercise Sheet 6, Exercise Sheet 7, and Exercise Sheet 8.
Name |
#stations / #nodes / #arcs |
constr. time |
av. query time |
av. SP cost |
Processor / RAM |
Language |
Example |
1,111 / 111,111 / 222,222 |
11min11sec |
111ms |
76min32sec |
Intel X5560 @ 2.8Ghz / 96 GB |
C++ |
SE KF |
1,831 / 830,100 / 1,371,298 |
2sec |
59ms |
13h34m01s |
Intel P8600 @ 2.4Ghz / 4 GB |
C++ |
niklas |
1,831 / 830,100 / 1,371,314 |
2sec |
260ms |
6h49m26s |
Intel 2410M @ 2.3GHz / 4 GB |
C++ |