Neo4j

mengyunlong · 03-07-2022

in my neo4j database, there are many kinds of relationships between people and vehicles, and each relationship has a weight value: Driving relationship (weight: 0.2)Own relationship (weight: 10)Ride relationship (weight: 0.1) Relationship attribut...

mengyunlong · 01-23-2022

In my project, Neo4J stores staff nodes and relationships between staff. People who have been to the same place within A period of time will have A relationship. For example, A and B have arrived at the same scene within A day, and A and B will hav...

mengyunlong · 03-08-2022

Although we haven't found the method of dynamic setting, thank you very much for your suggestion

mengyunlong · 03-07-2022

In my model, the weight of the relationship will be dynamically adjusted according to the calculation results. There are so many relationships that it will be very slow for me to update the weight of the relationship with the following statement: Mat...

mengyunlong · 01-25-2022

thanks a lot! The apoc.path.spanningTree() function solved my problem. thanks again!

mengyunlong · 01-25-2022

Thanks for your help I need to find not only nodes, but also the shortest path between nodes. This is what I want: Nodes :[P2, P3, P4, P5, P6, P7, P8, P9, P10], rel: [p1 - > p2], [p1 - > p3], [p1 - > p4], [p1 - > p5], [p1 - > p6], [p1 - > p7], [p1 -...

mengyunlong · 01-25-2022

Thank you for your help. Maybe I didn't express it clearly in my question. Is there any way to query only the shortest path, for example, query only [P1 ->p2], [P1 ->p3]... [p1 - > p10] such a shortest path, exclude [p1 - > p3 - > p2], [p1 - > p4...

Neo4j

User Statistics

User Activity

How to dynamically settings relationships weight

How to avoid factorial (n!) path?

Re: How to dynamically settings relationships weight

Re: How to dynamically settings relationships weight

Re: How to avoid factorial (n!) path?

Re: How to avoid factorial (n!) path?

Re: How to avoid factorial (n!) path?