Run Behat Features in Parallel.
ETL (extract, transform, load) template for UK rail fares
Minimalistic memoization decorator
API to resolve URI's
Command line tool to put the GB rail DTD feed into a MySQL compatible database
Planar Network proof of concept
Implementation of Dijkstra's algorithm that returns a shortest path tree
Miscellaneous array utilities written in TypeScript
Planar Network Ticket Wallet
SSIM to GTFS conversion tool
Converts transxchange data to GTFS
Implementation of the Round bAsed Public Transit Optimized Router (Raptor) journey planning algorithm.
Merge GTFS data sets
Create a GTFS dataset from the Eurostar timetable
Connection Scan Algorithm
Feature Toggle Decorator
Transfer Pattern Planning Algorithm
Eco Rewards Hub
Simple single character input boxes.
Solirius Sudoku Solver Challenge
Utility to help creating CCD config definitions