I'm looking for a convenient, free C++ library for graphs that include a solver for the maximum common subgraph (MCS) problem.
I'm aware of the Boost Graph Library and LEMON , but neither includes an MCS solver.
Asked
Active
Viewed 834 times
1 Answers
6
According to this ticket, Boost Graph Library added this feature around 3 years ago. The appropriate function (or set of functions) appears to be this function (mcgregor_common_subgraphs), which uses the McGregor algorithm.
Geoff Oxberry
- 30,394
- 9
- 64
- 127
-
I must have just missed it when browsing the TOC. I'll check it out and report back – Deathbreath Feb 17 '12 at 22:34
-
It's pretty hard to find. I had to do a few Google searches to find it, and I think it'd be easy to miss when scanning the TOC, so no worries. – Geoff Oxberry Feb 17 '12 at 23:25