Your experimental results for exercise sheet 3

Please sumarize your results from exercise sheet 3 in a row in the table below. In the first column, write your name (abbreviate if you are in a group, to keep it short). In the second column, put the programming language you used (C++ or Java). In the third column put the average running time (in seconds) for 1000 random queries using Dijkstra's algorithm. In the fourth column put the average running time (in seconds) for 1000 random queries using Dijkstra's algorithm with arc-flags. In the fifth column, put the time you needed to preprocess the graph for arcflag-routing. In the sixth column put the name of the dataset you computed these average times on (preferably Ba-Wü, but if that didn't work Saarland). In the following two columns, put the number of partitions you used and which partitioning-algorithm you used. In the last column put the used hardware.