[pgrouting-users] One_To_Many dijkstra

[Steve Horn]

This is a great contribution, and something I have been working on lately
(a distance matrix).

A question: does your algorithm build the graph one time (therefore only
calling into the postgres data once), and re-use the graph for each target
ID?

Thanks.
-Steve

On Fri, Jul 6, 2012 at 10:00 AM, Sylvain Housseman <hsylvio at gmail.com>wrote:

> Dear pg_routers,
>
> I added a page describing my first (very minor) contribution to the wiki:
> https://github.com/pgRouting/**pgrouting/wiki/One_to_many-**
> Dijkstra---To-review<https://github.com/pgRouting/pgrouting/wiki/One_to_many-Dijkstra---To-review>
>
> I don't know how to make it accessible (and at first if the function
> really is relevant, I believe that many of you coded a similar function...).
> As soon as it does not really modify the method (boost_dijkstra), I think
> the Algorithms section is not appropriate.
>
> Should I
> - remove the whole stuff?
> - add a new section to https://github.com/pgRouting/**pgrouting/wiki<https://github.com/pgRouting/pgrouting/wiki>(i.e. "Optional wrappers" or "Contrib. / betas")?
>
> Please feedback if you have the time to try it;
>
> Regards,
> HSylvio.
> ______________________________**_________________
> Pgrouting-users mailing list
> Pgrouting-users at lists.osgeo.**org <Pgrouting-users at lists.osgeo.org>
> http://lists.osgeo.org/**mailman/listinfo/pgrouting-**users<http://lists.osgeo.org/mailman/listinfo/pgrouting-users>
>



-- 
Steve Horn
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-users/attachments/20120706/f1635aef/attachment.html>