Fig. 3

Running time comparison for computing foremost and shortest walks. For each graph there are four box plots. From left to right these correspond to the following algorithms: foremost of Wu et al. (black), our foremost (red), shortest of Wu et al. (blue), our shortest (green). The boxes represent the 25% to 75% percentile of running times over the 100 runs for different sources on the respective temporal graph and the line within the boxes illustrates the 50% percentile (the median). The whiskers on the top and the bottom represent the best and worst running times, respectively. We only depict the running times of the algorithms after the data has been read in and was preprocessed by Transformation 1. The two plots with the crosses show the running times of reading in the input and preprocessing it