[pgrouting-users] Large OD matrices

[Manikanta Kondeti]

Hello,


On Tue, Dec 23, 2014 at 2:25 PM, Hans Skov-Petersen <hsp at ign.ku.dk> wrote:

>  Hi List,
>
>
>
> 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).
>
>
>
> I am looking at the All Pairs Shortest Path, Johnson’s or Floyd-Warshall
> Algorithms.
>
>
>
> Questions:
>
> 1)      Can anyone guide me to examples of the SQL syntax (or other code)
> involved in applying the algorithms
>
    Load your data in postgresql database. Open psql terminal and select
the db and run the query like
                    " SELECT id , source, target, cost [,reverse_cost]
FROM edge_table
 "


Refer to this tutorial:
http://workshop.pgrouting.org/chapters/shortest_path.html#multiple-shortest-paths-with-kdijkstra


>  2)      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?
>
>
>

No idea, I cant help you here :/


>  Cheers and Thanks
>
> Hans
>
>
- Manikanta

> _______________________________________________
> Pgrouting-users mailing list
> Pgrouting-users at lists.osgeo.org
> http://lists.osgeo.org/mailman/listinfo/pgrouting-users
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-users/attachments/20141223/c9c01247/attachment.html>