Let's say there are graphs A and B made by A', C' and B', C'. Then They could be both matched with a graph C made by C' and X' (a graph regular expression sort?).
I am doing research on turning images and articles into graphs.
Then, cluster them via common subgraphs.
Neo4j had been really helpful in this process and I hope that I could learn more from this community
Dear Community
I want to know whether neo4j has a builtin command for the subgraph matching algorithm.
Like, give a big graph G and a small graph g return all instances of the subgraph that is isomorphic with g in G.
or return one instance will good ...
Let's say each node has a number, if two nodes have the same number they could match.
But some nodes would contain a set of numbers and it could match nodes who contain a subset.
