<html>
<head>
<style>
.hmmessage P
{
margin:0px;
padding:0px
}
body.hmmessage
{
font-size: 10pt;
font-family:Verdana
}
</style>
</head>
<body class='hmmessage'>
I know I have to apply the Dijkstra algorithm (<A href="http://en.giswiki.net/wiki/Dijkstra's_algorithm">http://en.giswiki.net/wiki/Dijkstra's_algorithm</A>), but what I don´t know is how to pass just a layer as map (the layer of roads) and not the whole map, how to pass the point of origin and point of destiny to calculate the shortest path, how to calculate the sum of length of shortest path, how to select the different sections of the shortest path ... in ultimately, I do not know how to implement this operation. It is possible that this operation someone has already done, so that, can someone pass me the code so I can adapt it to mine? Also, I saw this post and I don´t know if it already has answer <A href="http://n2.nabble.com/Dijkstra's-algorithm-td1818808.html">http://n2.nabble.com/Dijkstra's-algorithm-td1818808.html</A>, if the person who created the post was able to use these dll's <A href="http://pgrouting.postlbs.org">http://pgrouting.postlbs.org</A>. Thank you very much.<BR> <BR>
<HR id=stopSpelling>
Date: Sun, 1 Mar 2009 09:56:54 -0500<BR>Subject: Re: [mapguide-users] Make a new operation: "calculate minimum path"<BR>From: rnorthcott@gmail.com<BR>To: mapguide-users@lists.osgeo.org<BR><BR>
<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=EC_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=EC_gmail_quote style="PADDING-LEFT: 1ex; 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/">¡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">http://lists.osgeo.org/mailman/listinfo/mapguide-users</A><BR><BR></BLOCKQUOTE></DIV><BR><br /><hr />Charlas más divertidas con el nuevo <a href='http://download.live.com' target='_new'>Windows Live Messenger</a></body>
</html>