I am rehashing an old project of mine, except I lost the Neomodel / Cypher code that does my subgraph isomorphism search of the database.
So since I have to rewrite it and yes it was slow. Was wondering what the fastest code would be. Does APOC have some procedures for this?
The method I used was to match the longest paths in the graph first, memoize, and I also used Regex matching because I needed that for variable substitutions. Crap, can't remember much more about it other than it worked.
Thanks for pointing me in the right direction.