1) status “labeled”, , status “unlabeled” for all

2) Let be a “labeled” node with the time window (i.e.,) and the smallest (the active node). IF GOTO 11)

3) FOR all edges DO

4) IF status “unlabeled” THEN

5) status “labeled” with the time window (i.e.,),

,

6) ELSE IF status “labeled” AND THEN

7) ,

8) END IF

9) DONE

10) status “finished”. GOTO 2)

11) OUTPUT and the s, d -path found with are the time windows of the source node s and a destination node d respectively (i.e. the reverse of ).