Hi,
I've got a problem to solve, and I'm suffering from a "programming
block" right now, so I thought I'd ask here if somebody has already
invented this kind of wheel...
For a flight planning app, I need to parse airways, consisting of
airway segments. Each segment has a short ID (2 to 5 letters) and is
delimited by two "fixes" (waypoints); these are identified by a 5-
letter ID. I've got a largish database of airway segments and fixes.
Now my app needs to find the segments that need to be flown to get
from fix A to fix B using airway X, and return them in the correct
order.
An example: I need to fly from "ARPEG" to "HMM" on airway "B5". My
database has the following segments from airway "B5":
B5 = ARPEG - OHMAR
B5 = ARPEG - RENNE
B5 = FLEVO - SPY
B5 = FLEVO - TENLI
B5 = FSK - TSL
B5 = FUL - SWALM
B5 = HMM - MOHNE
B5 = HMM - RELBI
B5 = LUR - PHO
B5 = LW - STUMM
B5 = LW - YYF
B5 = MOHNE - RENNE
B5 = OHMAR - SWALM
B5 = RELBI - RKN
B5 = RKN - TENLI
B5 = STUMM - YKA
B5 = HMM - MOHNE
B5 = MOHNE - RENNE
Now the result I need is something like "ARPEG-RENNE; MOHNE-RENNE;
HMM-MOHNE". From this I can extract the actual waypoints "ARPEG-RENNE-
MOHNE-HMM" to build my flight plan.
Maybe somebody here has already solved such a problem and has code s/
he is willing to share, or has a few tips how to solve this...
currently my brain just doesn't want to find the answer.
Thanks in advance!
Cheers,
Frank+++
--
Günter Schmidt GmbH
Frank Bitterlich eMail: [EMAIL PROTECTED]
Ben-Gurion-Ring 21 WWW: http://www.gsco.de/
D-60437 Frankfurt Tel.: 069 / 156809-29
GERMANY Fax: 069 / 156809-28
_______________________________________________
Unsubscribe or switch delivery mode:
<http://www.realsoftware.com/support/listmanager/>
Search the archives of this list here:
<http://support.realsoftware.com/listarchives/lists.html>
