×
INTELLIGENT WORK FORUMS
FOR COMPUTER PROFESSIONALS

Contact US

Log In

Come Join Us!

Are you a
Computer / IT professional?
Join Tek-Tips Forums!
  • Talk With Other Members
  • Be Notified Of Responses
    To Your Posts
  • Keyword Search
  • One-Click Access To Your
    Favorite Forums
  • Automated Signatures
    On Your Posts
  • Best Of All, It's Free!

*Tek-Tips's functionality depends on members receiving e-mail. By joining you are opting in to receive e-mail.

Posting Guidelines

Promoting, selling, recruiting, coursework and thesis posting is forbidden.

Students Click Here

Shortest path between two subway stations in Paris!?

Shortest path between two subway stations in Paris!?

Shortest path between two subway stations in Paris!?

(OP)
Hi,

I am quite new to PROLOG and I need to write this program, but I have no ideas. I would be very grateful for any help!

Assignment:
Write predicates in PROLOG to solve the folowing problem:

"To find the shortest path between two subway stations in Paris."

Here is the text file (nodes.txt), where his contents is:
* stationFrom - name of the station from where it starts;
* lineFrom - number of metro line from where it starts;
* stationTo - name of the station to where it will arrived;
* lineTo - number of metro line to where it will arrived;

The specified file should be used to generate facts based on
knowledge. There should be a predicate:

 solve(StartStation,EndStation,Path).

Who within the arguments StartStation and EndStation are input and refer to the names of the initial and final station respectively, while Path argument is an output argument and a list of names stations that need to pass to get from home to the final station (in shortest way).

Note: The distances between any two stations that have direct connections are equal.

RE: Shortest path between two subway stations in Paris!?

So you should really combine a path-search algorithm that will return a list of nodes with the 'length' predicate that computes the length of a list and voila: you have an algorithm that computes paths.

Path-search algorithms are a very common topic here, if you do a manual search in the last 30 topics, you'll find at least two threads referring to path-searching. You should adapt them to your particular needs described in the file you attached

Red Flag This Post

Please let us know here why this post is inappropriate. Reasons such as off-topic, duplicates, flames, illegal, vulgar, or students posting their homework.

Red Flag Submitted

Thank you for helping keep Tek-Tips Forums free from inappropriate posts.
The Tek-Tips staff will check this out and take appropriate action.

Reply To This Thread

Posting in the Tek-Tips forums is a member-only feature.

Click Here to join Tek-Tips and talk with other members! Already a Member? Login

Close Box

Join Tek-Tips® Today!

Join your peers on the Internet's largest technical computer professional community.
It's easy to join and it's free.

Here's Why Members Love Tek-Tips Forums:

Register now while it's still free!

Already a member? Close this window and log in.

Join Us             Close