From: Doug Gregor (dgregor_at_[hidden])
Date: 2006-01-10 08:33:41
On Jan 9, 2006, at 3:24 PM, Dave wrote:
> I have been trying to profile a few graph algorithms
> written using Boost Graph Library. I am using gprof
> for profiling.
We've never had good luck using gprof for profiling BGL algorithms.
There are far too many calls to small, inlined functions, which tend to
make it very hard for profilers to give accurate results.
> My graph has 100 vertices. It takes
> more than 10 minutes to compile, I suspect it is
> because of the size of the graph. The profile does not
> show any details though. It only shows the amount of
> time spent by the profiler. What am I doing wrong? Any
> help is greatly appreciated! Thanks.
We typically place a few timers in the code, manually, and use those
for performance estimates.
Doug