On Saturday, 1 September 2018 05:26:59 CEST you wrote:
On Sat, 1 Sep 2018 at 01:09, Julian Wolf via Boost-users <
boost-users@lists.boost.org> wrote:
I'm new to Boost and today I tried to use the mcgregor_common_subgraphs functions but can't find an explanation why the function shows such bad performance when I use it.
On windows/vc/boost-1.68, the same thing happens. The graphs are tiny [reading and parsing should take most of the time], it looks more like you [the algo] get stuck in a loop, i.e. you hit a cycle (in a graph) with 0.8 and not with 0.7 (or there's a bug in your algo, creating an endless loop).
Thank you for taking a look. It appears it's getting stuck around the
can_extend_graph function:
#0 0x000000000040da2b in
boost::iterators::detail::enable_if_interoperable