The link I provided discusses much more than the travelling salesman problem.
----- Original Message ----- From: Dan Bron <[EMAIL PROTECTED]> Date: Thursday, December 28, 2006 9:31 am Subject: Re: [Jprogramming] I know a shortcut > Roger wrote: > > http://en.wikipedia.org/wiki/Shortest_path_problem > > This is not the TSP. There is only one path to each end point. > It's > just that I don't need to start at the beginning. > > I've basically got a transporter that can land me on a certain > subset > of points along the path. If I were looking at only one path, the > > solution would be dead simple: pick the transporter-point closest > to > the end goal. > > But I've got a lot of paths, and I want to resolve them all at > once, > reusing lookup information where I can. > > I'm sure there's something pointer-chase-y or transitive-closure- > ish > that can be done. > > Just provide an inverse to jpath that you're proud of. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
