On Fri, 12 Dec 2003, Simmonds, Ashley (PTB) wrote: > see if http://www.routeware.dk/ helps any with this. Uffe Kousgaard is a > regular here on MI-L and should be able to tell you whether it'll do what > you want.
I'll second that. Routeware is a pretty good package. It might be a little more than you want to spend, but it does a lot and works great in MapInfo. However, if you can use MapBasic, you can try doing it yourself. I wrote a simple "shortest path" program that uses Dijkstra's algorithm in MapBasic a couple of years ago, and it worked fine. The paper I used is no longer at the URL where I found it, but google for "dijkstra's algorithm" and you'll have about 17,000 choices. Sometimes buying a tool is cheaper than doing it yourself, and after realizing what's involved, buying routeware was the better choice for me (but the problem I needed to solve was quite a bit more complicated than yours.) - Bill Thoen --------------------------------------------------------------------- List hosting provided by Directions Magazine | www.directionsmag.com | To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] Message number: 9542
