[pgrouting-users] TSP and how to contribute

[Daniel Kastl]

>
>
>> Sorry, I was wrong ... it's the right function you're using. Somehow read
>> driving directions somewhere before.
>> 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.
>>
>> This custom wrapper function takes the vertices and calculates a polygon
>> that contains all of them:
>>
>> https://github.com/pgRouting/pgrouting/blob/master/extra/driving_distance/sql/routing_dd_wrappers.sql#L78
>>
>
> 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 ?
>
> 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.
>
>

Driving Distance function uses Dijkstra algorithm:
https://github.com/pgRouting/pgrouting/blob/master/extra/driving_distance/src/drivedist.c#L341
Dijkstra only goes from vertex to vertex.

@Anton: do you have some hint?

Daniel


-- 
Georepublic UG & Georepublic Japan
eMail: daniel.kastl at georepublic.de
Web: http://georepublic.de
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.osgeo.org/pipermail/pgrouting-users/attachments/20110114/de79ee0c/attachment.html