[Boost-bugs] [Boost C++ Libraries] #9229: Minimal match size problem in mcgregor_common_subgraphs (and variants)

Subject: [Boost-bugs] [Boost C++ Libraries] #9229: Minimal match size problem in mcgregor_common_subgraphs (and variants)
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2013-10-11 11:39:45

#9229: Minimal match size problem in mcgregor_common_subgraphs (and variants)
-------------------------------------------------+----------------------
 Reporter:  Jakob Lykke Andersen <jlandersen@…>  |      Owner:  jewillco
     Type:  Patches                              |     Status:  new
Milestone:  To Be Determined                     |  Component:  graph
  Version:  Boost 1.54.0                         |   Severity:  Problem
 Keywords:                                       |
-------------------------------------------------+----------------------
 The common subgraph algorithm explicitly does not report common subgraphs
 of size 1 vertex. The size of the match is anyway passed to the callback,
 and thus the client code can easily make this check. The main algorithm
 does not seem to depend on the size check.
 The unit test for the algorithm can catch this restriction if 1 is passed
 as the first argument (the common subgraph to generate / search for).
 The attached patch removes the match size restriction.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/9229>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.