A* search refactor on finding the shortest routes in prolog

[misoijnr]

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/?ah7zh9zmhcn3a8q

http://www.mediafire.com/?kdcuv47guvks6kp

http://www.mediafire.com/?lgwq5580smzhd4p

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

amsterdam.pl

cheers,
play with it