<div>Sounds like more of a Math problem. Which amazingly, computers can do math better than anything else.</div>
<div> </div>
<div>Take a look here:</div>
<div><a href="http://www.springerlink.com/content/ux62418642458410/fulltext.pdf">http://www.springerlink.com/content/ux62418642458410/fulltext.pdf</a></div>
<div> </div>
<div>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.</div>
<div> </div>
<div>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.</div>
<div> </div>
<div>That's my 2 cents into how I'd tackle it, but there is probably more sophisticated mathematical algorithms you need to look into.</div>
<div> </div>
<div>-north<br><br></div>
<div class="gmail_quote">On Sat, Feb 28, 2009 at 3:29 PM, Sergio Nistal Calvo <span dir="ltr"><<a href="mailto:serginistal@hotmail.com">serginistal@hotmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">
<div>Hello, <br> <br>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.<br>
<br>Thanks.<br><br>
<hr>
Tienes un nuevo Messenger por descubrir. <a href="http://download.live.com/" target="_blank">¡Descárgatelo! </a></div><br>_______________________________________________<br>mapguide-users mailing list<br><a href="mailto:mapguide-users@lists.osgeo.org">mapguide-users@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/mapguide-users" target="_blank">http://lists.osgeo.org/mailman/listinfo/mapguide-users</a><br><br></blockquote></div><br>