Question; can't we use math and the flight pointer data and time between each point, to calculate all the possibilities and generate the lua data needed for all flightpaths?
I started slowly to read the dbc and how the different files related to flight work, it's a bit hard for now but I expect it to get much clearer the more I work with it, hehe. Anyway, just an idea to more pro coders and math guys out there!
TaxiPath.dbc <-- each pathId has a begining and an end node and a copper cost
TaxiPathNode.dbc <-- each flight route (i.e. SW to Goldshire) has unique PathNodeId but the second field is the same as the one in TaxiPath (so you can look it up and get a list of all nodes from start to finish for a specific flight) and has mapid and coordinates too
TaxiNodes.dbc <-- each node the bird flies to has a node with delay flag, mapid and coordinates and such