<br><div class="gmail_quote">On Fri, Jan 14, 2011 at 1:21 PM, Daniel Kastl <span dir="ltr"><<a href="mailto:daniel@georepublic.de">daniel@georepublic.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div class="gmail_quote"><div class="im"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="gmail_quote"><div><div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div class="gmail_quote"><div><div><br></div></div><div>Sorry, I was wrong ... it's the right function you're using. Somehow read driving directions somewhere before.</div><div>Driving directions does what you need, except that it returns you a list of vertices you can reach and the edges column doesn't return anything useful.</div>
<div><br></div><div>This custom wrapper function takes the vertices and calculates a polygon that contains all of them:</div><div><a href="https://github.com/pgRouting/pgrouting/blob/master/extra/driving_distance/sql/routing_dd_wrappers.sql#L78" target="_blank">https://github.com/pgRouting/pgrouting/blob/master/extra/driving_distance/sql/routing_dd_wrappers.sql#L78</a></div>
</div></blockquote><div><br></div></div></div><div>Yes this creates a polygon consisting all vertices but I want to display a road network that show how to go from source to outlying vertices. Actually I think driving distance's edge info should give that info since it calculates a distance from source. If that function know how distant is the vertice it should know the path am I wrong on this ? </div>
<div><br></div><div>As I wrote, calculating shortest path for each vertex from source does not seem feasible. Can we make driving distance to show edge info ? I am willing to conribute in that sense but I don't want to redo what is done before. </div>
<div> </div></div></blockquote><div><br></div></div><div>Driving Distance function uses Dijkstra algorithm:</div><div><a href="https://github.com/pgRouting/pgrouting/blob/master/extra/driving_distance/src/drivedist.c#L341" target="_blank">https://github.com/pgRouting/pgrouting/blob/master/extra/driving_distance/src/drivedist.c#L341</a></div>
<div>Dijkstra only goes from vertex to vertex.</div></div></blockquote><div><br></div><div>I know that dijkstra works from vertex to vertex but the shortest path implementation of dijksta in pgRouting is giving edge id's as an output that it passed. </div>
<div><br></div><div>Now I found a solution to this problem by marking edges who has source or target vertex ids that is listed in driving distance query's vertex list. But this takes 25 seconds to calculate. With a given edge id. </div>
<div><br></div><div>Is there any indexing or configuration to postgre that can speed up driving distance calculation ? or is there a more noble solution to this edge selection problem ?</div><div><br></div><div>Emre</div>
<div><br></div><div><br></div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div class="gmail_quote"><div><br></div><div>@Anton: do you have some hint?</div>
<div><br></div><font color="#888888"><div>Daniel</div><div> </div></font></div><div><div></div><div class="h5"><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>
</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>