I’ve implemented in Python the NP-Hard problem of Maximum Common Induced Subgraph.
It is the first worldwide efficient implementation in Python 3 !
The objective of Maximum Common Induced Subgraph is to find the biggest common subgraphs between two graphs.
Concrete applications : pattern matching, organic chemistry, etc.
See more on GitHub !
First Graph :