Thread: [jgrapht-developers] MCS implementation available?
Brought to you by:
barak_naveh,
perfecthash
From: Andreas M. <an...@ma...> - 2009-04-09 08:14:28
|
Hello, I am a little surprised that there is no Maximum Common Subgraph (MCS) implementation available in jgrapht. It shouldn't be difficult, since MSC can be reduced to Maximum Clique (MC) detection, which jgrapht apparently already supports. What are the reasons for this? Can anybody point me towards an existing implementation outside jgrapht? I have been looking for one, but no success. If none exists, I would be willing to collaborate in writing one. Best regards, Andreas -- http://www.maunz.de Let's face the obvious. Yesterday we were nerds. Today we're the cognitive elite. Let's conquer. - Chester G. Edwards |
From: John V. S. <js...@gm...> - 2009-04-09 17:21:23
|
Andreas Maunz wrote: > Hello, I am a little surprised that there is no Maximum Common Subgraph > (MCS) implementation available in jgrapht. It shouldn't be difficult, > since MSC can be reduced to Maximum Clique (MC) detection, which jgrapht > apparently already supports. > What are the reasons for this? Can anybody point me towards an existing > implementation outside jgrapht? I have been looking for one, but no > success. If none exists, I would be willing to collaborate in writing one. Hi Andreas, JGraphT grows by accretion (I am like a librarian accepting used book donations and shelving them). If you send me an MCS implementation together with a unit test, I'd be glad to put it in the next release. Thanks, JVS |