If I am not mistaken, the problem reduces to finding the hamiltonian path in a hamiltonian graph. So, the problem is NP-hard and polynomial time algorithms are not likely to find the optimal solution. -- View this message in context: http://www.nabble.com/Sling-Blade-Runner-tf4093227s24193.html#a12748947 Sent from the J Programming mailing list archive at Nabble.com.
---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
