[pgrouting-users] Shortest path with Dijkstra going through a set of points

[Stephen Woodbridge]

Tao,

This seems like a long time, but I do not have any hard numbers to 
compare it to. Can you post the query you are running for this?

For comparison, it would be interesting to compare performance for:

Dijkstra shortest path
AStar shortest path
TRSP shortest path (pass NULL for the restriction query)

For pgRouting, indexes are only used on the SQL side of things, like a 
spatial index to select the edges in the network, and maybe an index on 
the gid if you join the results back to the original edge table. Once 
the edges are read into pgRouting C code to build the graph, the graph 
is all in memory and the solution is all performed in memory, then the 
results are passed back to the SQL.

-Steve

On 9/11/2012 8:33 AM, Tao Romera Martinez wrote:
> It is the size of the selected road links that I use on the shortest
> path query.
> The whole network has several millions.
>
>
>
> On 2012/09/11, at 20:53, Daniel Kastl <daniel at georepublic.de
> <mailto:daniel at georepublic.de>> wrote:
>
>>
>>     Time taken by shortest_path: 350 ms
>>     Time taken by the SQL query passed to shortest_path: 25 ms
>>     Number of ways in the network: 4400
>>
>>
>> Is this your complete network or the size of the selected road links
>> that you use for your shortest path query?
>>
>> Daniel
>>
>>
>> --
>> Georepublic UG & Georepublic Japan
>> eMail: daniel.kastl at georepublic.de <mailto:daniel.kastl at georepublic.de>
>> Web: http://georepublic.de <http://georepublic.de/>
>> _______________________________________________
>> Pgrouting-users mailing list
>> Pgrouting-users at lists.osgeo.org <mailto:Pgrouting-users at lists.osgeo.org>
>> http://lists.osgeo.org/mailman/listinfo/pgrouting-users
>
>
> _______________________________________________
> Pgrouting-users mailing list
> Pgrouting-users at lists.osgeo.org
> http://lists.osgeo.org/mailman/listinfo/pgrouting-users
>