Re: Comparing graph shapes or soft matching.

[LanX]

> but if graphed, the lines should line up or nearly line up.

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. 🤷🏻‍♂️

*) graph vs chart, apple vs oranges, tomato vs potato, 🥔 vs 🍅, ...