Dear Hadeer, your problem looks like a variation of the Hamiltonian Circuit in which you have different starting and ending nodes. Here you can find a solution to the Tavelling Salesperson Problem, which is the Hamiltonian circuit with a minimization of the travelled distance: http://eclipseclp.org/archive/eclipse-users/0471.html You might take inspiration from this solution. Cheers, Marco On 12/02/13 10:16, Hadeer Diwan wrote: > Hello, > > I wanted to ask a question regarding the libraries available. Given a > graph, source node and a list of nodes, i want to find a route/path that > starts from the start node and passes by all the other nodes in the > list. I searched the graph library and i didn't find a predicate that > takes a list of nodes. Is there a predicate implemented that does that? > > > > > -- > Best Regards, > Hadeer Diwan -- Marco Gavanelli, Ph.D. in Computer Science Dept of Engineering University of Ferrara Tel/Fax +39-0532-97-4833 http://www.ing.unife.it/docenti/MarcoGavanelli/Received on Wed Feb 13 2013 - 11:22:41 CET
This archive was generated by hypermail 2.2.0 : Thu Feb 14 2013 - 18:13:28 CET