Hello,
i'm in a situation where i have graph of 300 000 nodes where such pattern occurs:
(A:Human)-[R:Has]-(B:Car)-[P:Stolen]-(C:Human)
i would like to create a new "extrapolated" edge:
(A)-[X:ExtrapolatedConnection]-(C)
(in order to be able to find all shortest paths between humans while understanding and assuming the above connection as direct),
however, when i try simply:
MATCH (A:Human)-[R:Has]-(B:Car)-[P:Stolen]-(C:Human)
MERGE (A)-[X:ExtrapolatedConnection]-(C)
the Execution failed
and Java heap space error
is returned after a while. I guess it's all wrong?
thank you