Hot answers tagged pgrouting
Yes, this is common practice to speedup queries. As less data you load as faster will be the response. Bounding box selects are the fastest way to select a subset of the table. Don't forget to have an index on the geometry column though. The following answer may give you an idea how to write your query: Why is any pgr_* routing function taking forever based ...
Complementing, previous answer.. montevideo-release-v4 is the latest branch. There is a lot of clean up that needs to be done as everything we coded is still there even if its not used.
I am no bike rider, but I am a pgRouting developer, I can tell you that we are doing efforts to incorporate all of BGL algorithms to pgRouting, unfortunately the one you ask is not there yet. We have pgr_dijkstra one to one, one to many, many to one and many to many based on the cost value you give. We also have pgr_KSP (k shortest paths) that give you the ...
It seems that SELECT seq from ways order by geom <-> ST_SetSrid(ST_MakePoint(lat, long), 4326) limit 1; did the trick
Only top voted, non community-wiki answers of a minimum length are eligible