Hello,

I'm converting an old board game to a computerised version. Its based on
the Great Western Railway so I need to convert all the station locations
into some sort of database. The starting point is Paddington station and
the rest of the stations branch out like a tree. At the moment I'm
trying to think of the best way to store this data. I need to
programmatically be able to travel to any location from any location
base on rules. These rules could be that certain station must be visited
or avoided. Some stations may have several lines associated with them so
that several different directions could be selected. Can anyone suggest
a solution for storing / accessing this data. Is there a mathematical
solution that I could apply to the data to create a tree ( a binary
split approach ?). I'd be grateful for any ideas or suggestions.

Ian


This email is intended solely for the person to whom it is addressed and may
contain confidential or legally privileged information. If you are not the
intended recipient, be advised that you have received this email in error and
that any use, dissemination, forwarding, printing or copying of this email is
strictly prohibited. Please notify the author by replying to this email and
destroying all copies of the email and attachments. Access to this email by
anyone else is unauthorised.

Email may be susceptible to data corruption, interception, unauthorised
amendment, viruses and delays or the consequences thereof. Any views or opinions
presented are solely those of the author and do not necessarily represent those
of Grosvenor Technology Ltd.


[Non-text portions of this message have been removed]