on Wed Mar 05 2008, "Michael Fawcett" <michael.fawcett-AT-gmail.com> wrote:
Here are my results in Release mode, full optimizations, averaged over 10 runs each. There were only about 15,000 nodes generated in the search, so it wasn't a very large graph.
at_goal() called every iteration - 0.121104 seconds
exception - 0.130855 seconds
Not very scientific I know...also it uses my own library, not BGL, but someone would have to modify BGL's algorithms and visitor class to use a function that returns a bool (continue searching, or not) to do a meaningful benchmark.
I know it's a bit late to add anythign here, but... the compiler being used is the most important piece of information I'd need to evaluate whether this number means anything at all. -- Dave Abrahams Boost Consulting http://boost-consulting.com