Difftastic spends a remarkable 49% of its runtime just reading and writing to a FxHashMap of ~1 million items. This hashmap stores the predecessor vertex when calculating the shortest route.
I'm running out of ideas. I can't use perfect hashmaps, are there other speed tricks?
