Subject: Re: [Boost-users] [BGL] Schultes and Sanders Contraction Hierarchies Routing
From: Michael Fawcett (michael.fawcett_at_[hidden])
Date: 2009-11-09 12:38:08
On Sat, Nov 7, 2009 at 7:21 PM, Stephen Woodbridge
<woodbri_at_[hidden]> wrote:
> Hi all,
>
> Has anyone looked at supporting Drs Schultes and Sanders Contraction
> Hierarchies Routing using Boost Graph?
>
> See here for more info on this:
> http://algo2.iti.kit.edu/english/routeplanning.php
>
> This requires lots of preprocessing of the graph, but offers 10-100 times
> faster performance on shortest path solutions.
>
> If Andrew, Jeremiah or others have time to look at some of the papers, I
> would be interested in your thoughts on supporting this or even knowing that
> BGL might be the wrong tool to implement this with.
>
> Thanks for any feedback you might be able to offer.
I really hope to hear a response on this - I just read the paper and
it looks fascinating.
Thanks for the link!
--Michael Fawcett