[pgrouting-dev] Scheduled Routing Algorithm

[Daniel Kastl]

On Sat, Aug 13, 2011 at 4:07 AM, Jay Mahadeokar <jai.mahadeokar at gmail.com>wrote:

> Hi Kishore,
>
> I read your report and saw the APSP_Johnson implementation. The prototype
> is:
>
> CREATE OR REPLACE FUNCTION apsp_johnson(sql text)
>
>          RETURNS SETOF apsp_edge
>
>          AS '$libdir/librouting'
>          LANGUAGE 'C' IMMUTABLE STRICT;
>
>
> I guess this serves the same function as the apsp algorithm we already
> have[1].
>
> I think for your application, you need APSP for all vertices in the
> database table. So, if you use:
>
> SELECT * from all_pairs_shortest_path
>
>
>     ('SELECT gid as id,source::integer,target::integer,length::double precision as cost
>     from ways where source in (select distinct(source) from ways)'::TEXT
>
>
>     ,false,false);
>
>
> it will solve your query. Please correct me if I am wrong, or any
> additional information is needed.
>
> Also, Daniel, Steve -
>
> Should we change my apsp implementation so that it gives option to use
> either johnsons boost implementation or warshall boost implementation? That
> would provide more options?
>
> [1] https://github.com/pgRouting/pgrouting/wiki/APSP
>
>
>
Hi Jay,

Thank you very much for looking into this and for your comments! That's very
valuable input.

Is it complicated to add this options?
If it's not difficult, it would be nice to able to specify it as an option.

Daniel







>
> --
> Regards,
> -Jay Mahadeokar
>
>
> _______________________________________________
> pgrouting-dev mailing list
> pgrouting-dev at lists.osgeo.org
> http://lists.osgeo.org/mailman/listinfo/pgrouting-dev
>
>


-- 
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-dev/attachments/20110813/9fa106e5/attachment.html