Abstract Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, study paths temporal graphs, that is, graphs where vertex set fixed but edge changes over time, gained more and attention. A time-respecting, or , if it uses edges with non-decreasing time stamps. We investigate basic constraint for paths, spent at each must n...