ReChor
Swiss journey plannerJava · JavaFX · EPFL coursework
A desktop route planner for Swiss public transport. Instead of a single “fastest” answer, it returns every Pareto-optimal journey between two stops, trading arrival time against the number of changes, computed on the real CFF timetables.
The JavaFX interface searches stations, lists the journeys of the day and opens any of them: lines, stops, platforms, times and every change.
Code on GitHub ↗connections in one weekday of the real CFF timetables, scanned in a single pass per query. About 258 MB of timetables for seven days, read from memory-mapped files.














