If all your data is in the database, then you can so queries within your shortest path query.<div>Look at this workshop example:</div><div><br></div><div><div><font face="'courier new', monospace">SELECT * FROM shortest_path('</font></div>
<div><font face="'courier new', monospace"> SELECT gid as id,</font></div><div><font face="'courier new', monospace"> source::integer,</font></div><div><font face="'courier new', monospace"> target::integer,</font></div>
<div><font face="'courier new', monospace"> length::double precision as cost</font></div><div><font face="'courier new', monospace"> FROM ways',</font></div>
<div><font face="'courier new', monospace"> 5700, 6733, false, false);</font></div></div><div><a href="http://workshop.pgrouting.org/chapters/shortest_path.html#core">http://workshop.pgrouting.org/chapters/shortest_path.html#core</a></div>
<div><br></div><div>You can replace start and end point with a query, which is in my example from the same table. But you can modify such a select however you like:</div><div><br></div><div><div><font face="'courier new', monospace">SELECT * FROM shortest_path('</font></div>
<div><font face="'courier new', monospace"> SELECT gid as id,</font></div><div><font face="'courier new', monospace"> source::integer,</font></div><div><font face="'courier new', monospace"> target::integer,</font></div>
<div><font face="'courier new', monospace"> length::double precision as cost</font></div><div><font face="'courier new', monospace"> FROM ways',</font></div>
<div><font face="'courier new', monospace"> (SELECT min(source)::int FROM ways), (SELECT max(source)::int FROM ways), false, false);</font></div></div><div><br></div><div>Does this help?</div><div>
Daniel<br>
<br><div class="gmail_quote">On Wed, Oct 12, 2011 at 4:21 PM, dy32 mutQ <span dir="ltr"><<a href="mailto:dmutq@yahoo.com">dmutq@yahoo.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div><div style="color:#000;background-color:#fff;font-family:times new roman, new york, times, serif;font-size:12pt"><div>hello all, <br>I have a question, how can I get the shortest path with dijkstra algorithm on a map but additionally have another layer or points of interest files from the map.<br>
I set up pgrouting from <a href="http://www.utdallas.edu/~ama054000/rt_tutorial.html" target="_blank">http://www.utdallas.edu/~ama054000/rt_tutorial.html</a><br><br>for example: I have two layers, hotel (points) and road (polylines)<br>
>From hotel A (start point) to hotel B (end point) I can get road 2,3,4<br><br>there is any way to integrate these two files (point and line) into one so that for the calculations. In other words, how can I connect two tables, road and hotel to get dijkstra result?<br>
<br>Thanks for your answers</div></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"><div><br></div>-- <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>
</div>