It's kind of similar in some ways to the traveling salesman problem. Which is not considered np-hard.
"How do you get to tokyo from paris", the cheapest, the shortest time, the least layovers, add a stop in X, etc. Not that easy.
Then you have to remember all the stuff under the hood like how are you caching all that information, how do you actually register the sales of all those tickets. Are they in your flight alliance? Are they goign through your regional airline systems too?
I would never want to touch that stuff. Way too hard. Way too many legacy systems powering it too, probably.
"How do you get to tokyo from paris", the cheapest, the shortest time, the least layovers, add a stop in X, etc. Not that easy.
Then you have to remember all the stuff under the hood like how are you caching all that information, how do you actually register the sales of all those tickets. Are they in your flight alliance? Are they goign through your regional airline systems too?
I would never want to touch that stuff. Way too hard. Way too many legacy systems powering it too, probably.
See also: https://franz.com/success/customer_apps/data_mining/itastory...
Which is now owened by google and probably powering google flights lol