#acl All:read,write
= Results for Exercise Sheet 8 (Transit Node Routing results) =

Add your row to the table below, following the examples already there. In the second column put Saar or !BaWü (put numbers for only one dataset, preferable !BaWü). In the third column, put the average time (per node) to compute the set of access nodes, in *milli*seconds (rounded to the next integer). In the fourth column, put the average number of access nodes per node. In the fifth column, put the put the average query time in *micro*seconds (rounded to the next integer). In the sixth column, put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for [[EfficientRoutePlanningSS2012/ReadOsmResults|Exercise Sheet 1]], [[EfficientRoutePlanningSS2012/DijkstraResults|Exercise Sheet 2]], [[EfficientRoutePlanningSS2012/AstarResults|Exercise Sheet 3]], [[EfficientRoutePlanningSS2012/ArcFlagsResults|Exercise Sheet 4]], [[EfficientRoutePlanningSS2012/ContractionResults|Exercise Sheet 6]], and [[EfficientRoutePlanningSS2012/ContractionHierarchiesResults|Exercise Sheet 7]].

||'''Name''' ||'''Dataset'''|| '''av. time access nodes'''|| '''#access nodes''' || '''av. query time'''|| ''' av. SP cost''' || '''Processor / RAM''' ||'''Language''' ||
||Example ||!BaWü || 1ms|| 11 || 11µs || 111min11sec ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ ||
||SE KF ||!BaWü || 1ms|| 36 || 4µs || 97min24sec ||Intel P8600 @ 2.4Ghz / 4 GB ||C++ ||
||Stefan W ||Saarland || 1ms|| 6 || 26µs || 20min44sec ||Intel 2670QM @ 2.2Ghz / 6 GB ||Java ||
||Viktor ||Saarland || 7ms|| 6 || 24µs || 22min33sec ||Intel T9300 @ 2.5GHz / 6 GB  ||Java ||
||niklas ||Saarland || 5ms|| 5 || 7µs || 23min40sec ||Intel 2410M @ 2.3GHz / 4 GB ||C++ ||
||Tobias ||Saarland || 386ms|| 12 || 10µs || 32min50sec ||Intel N450 @ 1.66GHz / 2 GB ||C++ ||