Re: [Boost-users] performance of dijkstra_shortest_paths

Subject: Re: [Boost-users] performance of dijkstra_shortest_paths
From: Bhaskara Marthi (bhaskara_at_[hidden])
Date: 2009-05-01 11:21:46

On Thu, Apr 30, 2009 at 1:34 PM, Bhaskara Marthi <bhaskara_at_[hidden]> wrote:

> I recently ran into a situation where dijkstra_shortest_paths in the boost
>
> graph library was running very slowly.  When I replaced the call to
>
> dijkstra_shortest_paths with the code below, things were a couple of
> orders
>
> magnitude faster.  Any idea why?
>
>
>

> Try building in release mode? The debugging instrumentation in the BGL can
>
kill performance.
>

> Andrew Sutton
>
andrew.n.sutton_at_[hidden]

I'm compiling my source files with -O3 using gcc on ubuntu.   That should be
sufficient, right?
- Bhaskara