Fig. 11From: Algorithms for optimal min hop and foremost paths in interval temporal graphsSpeedups over Wu’s algorithm for min-hop paths on Koblenz datasetsBack to article page