On Jun 20, 2006, at 17:21 UTC, Frank Bitterlich wrote:
> 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...
Yes, this is a classic pathfinding problem, where the "state" is simply what
fix (waypoint) you're at, and the neighbors are all other states you can reach
via those flight corridors. (I'd start by building a dictionary that maps any
fix to all other fixes to which it's connected.) You can use any search
algorithm to find a solution, but if you know where these waypoints are
physically located (such that you can compute a distance between any two), then
it's ideal for A*.
All the major search algorithms are described and implemented here:
<http://www.rbdeveloper.com/browse/1.5/1510/>
Best,
- Joe
--
Joe Strout -- [EMAIL PROTECTED]
Verified Express, LLC "Making the Internet a Better Place"
http://www.verex.com/
_______________________________________________
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>
