I have created a graph with 3 paths as below.
Data:
a,b
b,c
d,e
f,e
g,h
Graph
a->b->c
d->e<-f
g->h
Desired outupt
a,uuid_1
b,uuid_1
c,uuid_1
d,uuid_2
e,uuid_2
f,uuid_2
g,uuid_3
h,uuid_3
Note : I have 50 million nodes.
I tried one more thing and this one also working fine.
But I need to check the performance of this solution.
CALL algo.unionFind('Person', 'KNOWS',
{write: true,writeProperty: 'groupId'})
yield nodes RETURN nodes
I really appreciate for your help.
I have made minor changes in the query by replacing uuid with id of node.
In apoc.periodic.commit function what is the meaning of limit clause?
In my case Its only running for 10000 nodes only which I passed in limi...
Above solution working fine in small dataset.
But In case of big dataset (50 million node) its running forever.
I can load the csv again if neo4j has better option.
Thanks alot for the reply.
