Looping problem

[Dar Scott]

On Jun 20, 2005, at 5:01 PM, Glen Bojsza wrote:

> The scope is to have a number of locations and the minimum path
> connecting the locations.

This looks like it might be a variation on the traveling salesman 
problem and you might find lots of references to approaches to 
solutions to that.

Dar
-- 
**********************************************
     DSC (Dar Scott Consulting & Dar's Lab)
     http://www.swcp.com/dsc/
     Programming and software
**********************************************