<div dir="ltr">Hello, <div><br><div class="gmail_extra"><br><div class="gmail_quote">On Tue, Dec 23, 2014 at 2:25 PM, Hans Skov-Petersen <span dir="ltr"><<a href="mailto:hsp@ign.ku.dk" target="_blank">hsp@ign.ku.dk</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">





<div lang="DA" link="blue" vlink="purple">
<div>
<p class="MsoNormal">Hi List,<u></u><u></u></p>
<p class="MsoNormal"><u></u> <u></u></p>
<p class="MsoNormal"><span lang="EN-US">Being rather new at PgRouting (but not to network analysis in general), I am looking for means by which I efficiently can construct all pair, shortest path OD matrices for quite large networks (i.e. a graph of the road
 network of Denmark, 2.107.981 edges, 860.380 nodes).<u></u><u></u></span></p>
<p class="MsoNormal"><span lang="EN-US"><u></u> <u></u></span></p>
<p class="MsoNormal"><span lang="EN-US">I am looking at the All Pairs Shortest Path, Johnson’s or Floyd-Warshall Algorithms.<u></u><u></u></span></p>
<p class="MsoNormal"><span lang="EN-US"><u></u> <u></u></span></p>
<p class="MsoNormal"><span lang="EN-US">Questions:<u></u><u></u></span></p>
<p><u></u><span lang="EN-US"><span>1)<span style="font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:'Times New Roman'">     
</span></span></span><u></u><span lang="EN-US">Can anyone guide me to examples of the SQL syntax (or other code) involved in applying the algorithms</span></p></div></div></blockquote><div>    Load your data in postgresql database. Open psql terminal and select the db and run the query like     </div><div>                    " <span class="" style="line-height:15.6000003814697px;color:rgb(0,112,32);font-weight:bold">SELECT</span><span style="color:rgb(51,51,51);line-height:15.6000003814697px;background-color:rgb(238,255,204)"> </span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">id </span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">,</span><span style="color:rgb(51,51,51);line-height:15.6000003814697px;background-color:rgb(238,255,204)"> </span><span class="" style="line-height:15.6000003814697px;color:rgb(0,112,32);font-weight:bold">source</span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">,</span><span style="color:rgb(51,51,51);line-height:15.6000003814697px;background-color:rgb(238,255,204)"> </span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">target</span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">,</span><span style="color:rgb(51,51,51);line-height:15.6000003814697px;background-color:rgb(238,255,204)"> </span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">cost</span><span style="color:rgb(51,51,51);line-height:15.6000003814697px;background-color:rgb(238,255,204)"> </span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">[,</span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">reverse_cost</span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">] </span><span class="" style="line-height:15.6000003814697px;color:rgb(0,112,32);font-weight:bold">FROM</span><span style="color:rgb(51,51,51);line-height:15.6000003814697px;background-color:rgb(238,255,204)"> </span><span class="" style="color:rgb(51,51,51);line-height:15.6000003814697px">edge_table  </span>"</div><div><br></div><div><br></div><div>Refer to this tutorial: <a href="http://workshop.pgrouting.org/chapters/shortest_path.html#multiple-shortest-paths-with-kdijkstra">http://workshop.pgrouting.org/chapters/shortest_path.html#multiple-shortest-paths-with-kdijkstra</a>  </div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex"><div lang="DA" link="blue" vlink="purple"><div><p><span lang="EN-US"><u></u><u></u></span></p>
<p><u></u><span lang="EN-US"><span>2)<span style="font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:'Times New Roman'">     
</span></span></span><u></u><span lang="EN-US">Is there a way that the search (and output) can be simplified by limiting the search to only take OD within a given max-search-radius into account?<u></u><u></u></span></p>
<p class="MsoNormal"><span lang="EN-US"><u></u> </span></p></div></div></blockquote><div><br></div><div>No idea, I cant help you here :/</div><div> </div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex"><div lang="DA" link="blue" vlink="purple"><div><p class="MsoNormal"><span lang="EN-US"><u></u></span></p>
<p class="MsoNormal"><span lang="EN-US">Cheers and Thanks<span class=""><font color="#888888"><u></u><u></u></font></span></span></p><span class=""><font color="#888888">
<p class="MsoNormal"><span lang="EN-US">Hans<u></u><u></u></span></p>
</font></span></div>
</div>

<br></blockquote><div><br></div><div>- Manikanta </div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">_______________________________________________<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></blockquote></div><br></div></div></div>