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