Re: simple london underground query system
- From: "Pierpaolo BERNARDI" <pierpaolo@xxxxxxxxxxxxx>
- Date: 8 Aug 2006 22:25:42 +0200
On Tue, 08 Aug 2006 18:02:33 +0200, sheddy <andysheard@xxxxxxxxxxxxxx> wrote:
Hello everyone,
I'm trying to teach myself prolog by attempting to program a system
that stores information about stations on one london underground line
and allows the user to ask simple questions. For example, how many
stops from station x to station y? How long will it take to get to
station x from station y? Which stations allow me to connect to line x?
and which one is closest?
The information i need to store is the station name (obviously), the
time it takes to travel between one station and the next (e.g. 3 mins)
and the names of the lines that the station interchanges with (e.g.
circle or northern). Some stations can interchange with more than one
line but then some don't interchange with any.
How would i go about this? I did some very basic prolog during a-level
computing and that was a few years ago now.
Any pointers would be greatly appreciated!
Represent the network with a series of facts like:
connection(FromStation,ToStation,TimeNeeded).
....
station(StationName,Line,And,All,The,Other,Data,You,May,Need).
....
Then the queries you want to do are simple graph algorithms
that you can find in any graph algorithm or operation research
book (and some prolog manuals too).
Cheers
P.
--
Anything below this line is being added by the newsserver
.
- References:
- simple london underground query system
- From: sheddy
- simple london underground query system
- Prev by Date: Re: some help with recursion again
- Next by Date: Re: some help with recursion again
- Previous by thread: Re: simple london underground query system
- Next by thread: Re: simple london underground query system
- Index(es):
Relevant Pages
|
|
