Sounds like more of a Math problem. Which amazingly, computers can do math better than anything else.
Take a look here: http://www.springerlink.com/content/ux62418642458410/fulltext.pdf the resources in the back, and the theory is what you'll have to take from it to build your own shortest distance routes against your datasets. But you're going to probably be doing a lot of looping, and array loading/sorting. Finding any intersections, then at the end, you'll be building different routes, and if any valid route grows longer than your current route, you end the loop, and go build a new route until you'r out of route choices. That's my 2 cents into how I'd tackle it, but there is probably more sophisticated mathematical algorithms you need to look into. -north On Sat, Feb 28, 2009 at 3:29 PM, Sergio Nistal Calvo < serginis...@hotmail.com> wrote: > Hello, > > I have a layer in a map that is about communication roads and I would like > to make a operation which is to calculate the minimum path. I do not know > how make it, any help is appreciated. I uses apache and php. > > Thanks. > > ------------------------------ > Tienes un nuevo Messenger por descubrir. ¡Descárgatelo! > <http://download.live.com/> > > _______________________________________________ > mapguide-users mailing list > mapguide-users@lists.osgeo.org > http://lists.osgeo.org/mailman/listinfo/mapguide-users > >
_______________________________________________ mapguide-users mailing list mapguide-users@lists.osgeo.org http://lists.osgeo.org/mailman/listinfo/mapguide-users