in reply to Comparing graph shapes or soft matching.
Very fuzzy problem description.
> I am not a maths expert
I am in the (worst) case.
The subgraph isomorphism problem is NP complete, the complexity of the graph isomorphism problem unsolved.
This doesn't mean that you won't find a practical algorithm in over 90 percent of the cases. But once you hit a hard one it will take ages to complete.
Of course this could (likely) be an easy XY problem*, but without SSCCE how can we possibly tell. 🤷🏻♂️
Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery
*) graph vs chart, apple vs oranges, tomato vs potato, 🥔 vs 🍅, ...
|
---|