https://svn.boost.org/trac10/ticket/694 <pre class="wiki">A very easy way to implement this is to generate a product graph of two graphs and find cliques in this graph. Every clique is a MCS. I prefer that you provide the base objects for that instead of implementing them on my own. We need this for the OpenBabel project finding MCS in molecules. BTW, a short hint how to transform a molecule into a nominal or numerical labelled graph would be nice. And the product graph should allow both label types. </pre> en-us /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/694 Trac 1.4.3 Jeremiah Willcock Thu, 25 Jun 2009 16:51:19 GMT https://svn.boost.org/trac10/ticket/694#comment:1 https://svn.boost.org/trac10/ticket/694#comment:1 <ul> <li><strong>status</strong> <span class="trac-field-old">assigned</span> → <span class="trac-field-new">closed</span> </li> <li><strong>resolution</strong> <span class="trac-field-old">None</span> → <span class="trac-field-new">fixed</span> </li> </ul> <p> (In <a class="changeset" href="https://svn.boost.org/trac10/changeset/54342" title="Added example for McGregor algorithm from Michael Hansen; refs #3134; ...">[54342]</a>) Added example for <a class="missing wiki">McGregor</a> algorithm from Michael Hansen; refs <a class="closed ticket" href="https://svn.boost.org/trac10/ticket/3134" title="#3134: Patches: BGL patches to move into 1.40 (closed: fixed)">#3134</a>; fixes <a class="closed ticket" href="https://svn.boost.org/trac10/ticket/694" title="#694: Feature Requests: Add Maximum Common Subgraph (MCS) algorithm (closed: fixed)">#694</a> </p> Ticket