Subject: Re: [Boost-users] [Graph] On Dijkstra SSSP performance
From: Dave Abrahams (dave_at_[hidden])
Date: 2012-03-14 23:10:05
on Mon Mar 05 2012, Leo Hidd <leohidd-AT-gmail.com> wrote:
> It seems to massively use STL containers (like vectors and lists)
> which maybe be the reason why it runs slower, but I'm not sure. Is
> there a way to use other graph type so that it can run faster?
One other thing: you might want to check the path you get from your own
implementation against the one Boost.Graph gives you, just to make sure
they're actually doing the same computation ;-)
-- Dave Abrahams BoostPro Computing http://www.boostpro.com