Extreme paths on graphs with simultaneously varying arc durations

In this paper, we propose an algorithm for finding the fastest path on a graph with two weights on each arc, namely, the times required to pass the arc before the beginning of rush hour and during rush hours, if the time of the beginning of rush hours is also indicated. The algorithm proposed can be considered a modification of the classical E. Dijkstra algorithm.