<br><br><div class="gmail_quote">2011/4/27 Maria Battarra <span dir="ltr"><<a href="mailto:maria.battarra@gmail.com">maria.battarra@gmail.com</a>></span><br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div lang="EN-US" link="blue" vlink="purple"><div><p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Cambria","serif"">Great! After playing a little.. I made it work </span><span style="font-size:11.0pt;font-family:Wingdings">J</span><span style="font-size:11.0pt;font-family:"Cambria","serif""> Many thanks..</span></p>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Cambria","serif"">Next I need to figure out:</span></p><p><span style="font-size:11.0pt;font-family:"Cambria","serif""><span>1)<span style="font:7.0pt "Times New Roman""> </span></span></span><span style="font-size:11.0pt;font-family:"Cambria","serif"">How to compute the distance associated to the shortest path (is it ok if I define in the table dijsktra_result a new column “length” and I use the function “</span><span style="font-size:10.0pt;font-family:"Cambria","serif"">UPDATE edges SET length = length(the_geom);”?)</span><span style="font-size:11.0pt;font-family:"Cambria","serif""></span></p>
<p><span style="font-size:11.0pt;font-family:"Cambria","serif""><span>2)<span style="font:7.0pt "Times New Roman""> </span></span></span><span style="font-size:10.0pt;font-family:"Cambria","serif"">Visualize the indexes of the origin and destinations in the map (so as I can compute shortest paths from known origins and destinations)</span><span style="font-size:11.0pt;font-family:"Cambria","serif""></span></p>
<p><span style="font-size:11.0pt;font-family:"Cambria","serif""><span>3)<span style="font:7.0pt "Times New Roman""> </span></span></span><span style="font-size:10.0pt;font-family:"Cambria","serif"">Arrange everything in a two “for cycles” so to come out with an origin destination matrix..</span></p>
</div></div></blockquote><div><br></div><div>Maybe you want to look at the workshop once: <a href="http://workshop.pgrouting.org">http://workshop.pgrouting.org</a></div><div>It will answer the most common questions.</div>
<div><br></div><div>If you need a distance matrix, you could try APSP (All-pair-shortest-path) algorithm, that Jay developed a few weeks ago. It's currently in the pgRouting fork of his Github account. But you probably better don't try this on Windows, because compiling pgRouting on Windows isn't trivial task.</div>
<meta http-equiv="content-type" content="text/html; charset=utf-8"><div><br></div><div>Daniel</div><div><br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div lang="EN-US" link="blue" vlink="purple">
<div><p><span style="font-size:11.0pt;font-family:"Cambria","serif""></span></p><p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Cambria","serif"">I hope I will manage..Suggestions? </span></p>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Cambria","serif"">Thanks a lot, you really helped me a lot!</span></p><p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Cambria","serif"">Maria</span></p>
</div></div><br>_______________________________________________<br>
Pgrouting-users mailing list<br>
<a href="mailto:Pgrouting-users@lists.osgeo.org">Pgrouting-users@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-users" target="_blank">http://lists.osgeo.org/mailman/listinfo/pgrouting-users</a><br>
<br></blockquote></div><br><br clear="all"><br>-- <br><span style="font-family:arial, sans-serif;font-size:13px;border-collapse:collapse">Georepublic UG & Georepublic Japan<br>eMail: <a href="mailto:daniel.kastl@georepublic.de" style="color:rgb(66, 99, 171)" target="_blank">daniel.kastl@georepublic.de</a><br>
Web: <a href="http://georepublic.de/" style="color:rgb(66, 99, 171)" target="_blank">http://georepublic.de</a></span><br>