Re: Storing real data for train stations

I think you mean 'Breadth-first' and 'Depth-first' algorithms.

Ian, here are a few links to get you started:
http://www.delphiforfun.org/Programs/Library/Graphs1.htm
http://www.delphiforfun.org/Programs/Math_Topics/ShortestPath.htm

http://www.math.uoc.gr/~ictm2/Proceedings/pap229.pdf

http://www.devarticles.com/c/a/Development-Cycles/Learning-About-the-Graph-Construct-using-Games-Part-1/
(This last in TinyURL form: http://tinyurl.com/yuc25m)

--- In JEDI-SDL%40yahoogroups.com">JEDI-SDLyahoogroups.com, "William Cairns&quot; <william.cairns...>
wrote:
&gt; Hi Ian
> What you are looking for is a Graph along with all the algoriths such as
> breath first, depth first etc.
> A graph is an interconnected structure that allows multiple connections
> from each point to other points, the links can then have weights (or
> other characteristics) that affect the way they get traversed.
>
> Have a look at depth first and breath first search algorithms to work
>; out routes between points.

Messages in this topic (3) Reply (via web post) | Start a new topic

.

Thanks for these examples. I have downloaded the source and they look
like they are exactly what I need. Many thanks.


________________________________

From: JEDI-SDL%40yahoogroups.com">JEDI-SDLyahoogroups.com [mailto: JEDI-SDL%40yahoogroups.com">JEDI-SDLyahoogroups.com] On
Behalf Of tinyallen
Sent: Monday, February 12, 2007 7:56 PM
To: JEDI-SDL%40yahoogroups.com">JEDI-SDLyahoogroups.com
Subject: [JEDI-SDL] Re: Storing real data for train stations

I think you mean 'Breadth-first' and 'Depth-first' algorithms.

Ian, here are a few links to get you started:
http://www.delphiforfun.org/Programs/Library/Graphs1.htm
&lt;http://www.delphiforfun.org/Programs/Library/Graphs1.htm>
http://www.delphiforfun.org/Programs/Math_Topics/ShortestPath.htm
&lt;http://www.delphiforfun.org/Programs/Math_Topics/ShortestPath.htm>

http://www.math.uoc.gr/~ictm2/Proceedings/pap229.pdf
<http://www.math.uoc.gr/~ictm2/Proceedings/pap229.pdf>

http://www.devarticles.com/c/a/Development-Cycles/Learning-About-the-Gra
ph-Construct-using-Games-Part-1/
&lt;http://www.devarticles.com/c/a/Development-Cycles/Learning-About-the-Gr
aph-Construct-using-Games-Part-1/>
(This last in TinyURL form: http://tinyurl.com/yuc25m
&lt;http://tinyurl.com/yuc25m> )

--- In JEDI-SDL%40yahoogroups.com">JEDI-SDLyahoogroups.com <mailto:JEDI-SDL%40yahoogroups.com> ,
"William Cairns&quot; <william.cairns...>
wrote:
&gt; Hi Ian
> What you are looking for is a Graph along with all the algoriths such
as
> breath first, depth first etc.
> A graph is an interconnected structure that allows multiple
connections
> from each point to other points, the links can then have weights (or
> other characteristics) that affect the way they get traversed.
>
> Have a look at depth first and breath first search algorithms to work
>; out routes between points.

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]

Messages in this topic (4) Reply (via web post) | Start a new topic

.