Tek-Tips is the largest IT community on the Internet today!
Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!
-
Congratulations dencom on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!
-
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... -
member predicate
hi, help me put this predicate into perspective, was trying to make one to find path on the facts attached. findpath(Dest,L) :- find_route(node(NodeID), Dest, L. findpath(S, Dest, Sol) :- way(S, Dest, [S], Path), invert(Path, Sol). path( P, P, L, L)... -
how to create one predicate from fact base
hi guys, the following are facts from my database for prolog, node represent points with ID n lat and long node_tag has similar ID with nodes n more description all the way to way_tag, how do i create a predicate(s) to help me generate one one list with one node and link it to all the rest...
