Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
3.7k views
in Technique[技术] by (71.8m points)

python - Neo4j algo.unionFind equivalent with new Graph Data Science Library

I have a cypher projection that used algo.unionFind in Neo4j. However, that algorithim has been deprecated. My query was:

CALL algo.unionFind('MATCH (n) WHERE n.dtype="VALUE" RETURN id(n) AS id','MATCH p=(n)-[]-(m) WHERE n.dtype="VALUE" AND m.dtype="VALUE" RETURN id(n) AS source, id(m) AS target', {write:true, partitionProperty:"partition", graph:'cypher'}) YIELD nodes, setCount, loadMillis, computeMillis, writeMillis

I was hoping to find an equivalent approach with the Graph Data Science Library that runs the query and writes a new property partition in my nodes.

Any help would be greatly appreciated!


与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Answer

0 votes
by (71.8m points)

The algorithm has been renamed to gds.wcc.write in the new GDS library.


与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

2.1m questions

2.1m answers

60 comments

56.5k users

...