Originally Posted by SFOtoBOS

I wrote some perl code to take fare routing rules and come up with all possible routes. (Hopefully. UA's routing rules are so many lines long, but by using the timetable to trim down bogus routings it seems to process in reasonable time.) Then I have code that sorts those routes by distance and finally it looks through the timetable (using the published pdf timetable which I parse in) to find which routes one can actually fly. (Would be fun to play around with interesting constraints like equipment type, etc.)