Hi,<br>
Lately I have been looking for a good C/C++ implementation of an
algorithm for finding the maximum common subgraph in Boost::Graph. The
algorithms I have looked for is mainly&nbsp; Bron-Kerbosch and the
MCS&nbsp; algorithm, but I am very open for alternatives.&nbsp; The
implementation must be able to handle directed graphs containing
self-loops (it is possible to have two edges at the same time between
two nodes i-&gt;j, j-&gt;i). Do you know of any implementation? <br>
<br>
Thanks<br>
Andreas Saebjornsen<br>