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

A* search refactor on finding the shortest routes in prolog

A* search refactor on finding the shortest routes in prolog

A* search refactor on finding the shortest routes in prolog

Hi, i have come up with the codes below search.pl preprocess.pl and preprocess1.pl  and i have data in luven.pl

I have used A* algorith to search for routes between two nodes.

Can someone refactor for me and come up with a simpler way of doing it, since i find mine cluttered.
The codes are in the links below
how it works:
Preprocess gets data from luven.pl and processes to get nodes,
search.pl uses A8 to search between the shortest routes

http://www.mediafire.com/?nv5fca84fe5ok2g  amsterdam.pl

play with it

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