A computer implemented method for public transportation journey planning comprising: providing transit graph data with nodes that correspond to stations for vehicles and the times of the day at which the vehicles stop at the stations; defining nodes in the transit graph data that simulate individual times of the day for which vehicles may stop at a first of the stations according to a repeat schedule in which successive vehicle journeys from the first station are separated by a common time period, the simulated individual times of the day for the respective nodes for the repeat schedule being separated successively by a period less than or equal to the common time period and wherein the repeat schedule runs at the first station from a start time of the day until an end time of the day such that nodes in the transit graph data are defined at times T1, T2 - P and at additional times in successive intervals ≤ P between T1 and T2-P; performing a precomputation for a plurality of pairs of stations represented in the transit graph data, to provide at least one transfer pattern that corresponds to at least one feasible route between each respective pair of stations; storing the at least one transfer pattern for the pairs of stations; performing a query computation on the stored transfer patterns to determine a journey schedule for a route between a target station and a destination station; and if the route extends through the first station and involves travel according to the repeat schedule, defining for the route that the journey time includes a waiting time period at the first station not less than the common time period, if an arrival time at the first station is predicted to be before the start time of the day of the repeat schedule by more than said common time period, setting a waiting time at the first station to be not less than the difference between the arrival time and the start time of day, and if the arrival time at the first station is predicted to be after a time that corresponds to the end time of day less the common period of the repeat schedule, rejecting the route as unfeasible. providing transit graph data with nodes that correspond to stations for vehicles and the times of the day at which the vehicles stop at the stations; defining nodes in the transit graph data that simulate individual times of the day for which vehicles may stop at a first of the stations according to a repeat schedule in which successive vehicle journeys from the first station are separated by a common time period, the simulated individual times of the day for the respective nodes for the repeat schedule being separated successively by a period less than or equal to the common time period and wherein the repeat schedule runs at the first station from a start time of the day until an end time of the day such that nodes in the transit graph data are defined at times T1, T2 - P and at additional times in successive intervals ≤ P between T1 and T2-P; performing a precomputation for a plurality of pairs of stations represented in the transit graph data, to provide at least one transfer pattern that corresponds to at least one feasible route between each respective pair of stations; storing the at least one transfer pattern for the pairs of stations; performing a query computation on the stored transfer patterns to determine a journey schedule for a route between a target station and a destination station; and if the route extends through the first station and involves travel according to the repeat schedule, defining for the route that the journey time includes a waiting time period at the first station not less than the common time period, if an arrival time at the first station is predicted to be before the start time of the day of the repeat schedule by more than said common time period, setting a waiting time at the first station to be not less than the difference between the arrival time and the start time of day, and if the arrival time at the first station is predicted to be after a time that corresponds to the end time of day less the common period of the repeat schedule, rejecting the route as unfeasible.