This website uses cookies. By clicking Accept, you consent to the use of cookies. Click Here to learn more about how we use cookies.
Accept
Reject
cancel
Turn on suggestions
Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.
Showing results for 
Search instead for 
Did you mean: 
Help

Head's Up! These forums are read-only. All users and content have migrated. Please join us at community.neo4j.com.

mayassia
Node Link
since ‎06-09-2020
‎01-04-2023

User Statistics

  • 10 Posts
  • 0 Solutions
  • 2 Kudos given
  • 0 Kudos received

User Activity

Migration from 3.5 to 4.4.11

01-01-2023
Hi everyone, first I wish you all hapyy new year. I have an old version of neo4j database which is 3.5 with the name graph.db. I want to copy data on version 4.4.11 using neo4j-admin but the problem that it does not work. I also tried to copy the ...

iterate through two lists with foreach

11-01-2022
Hi everyone, I'm trying to use a parametrized query to create my graph. ````:param A => ["AA","AB"];:param B => ["BA","BB"]; WITH $A as A, [10,30,30,26] as durationFOREACH (c in A and d in duration| CREATE(:field { name:c, duration:d})); This query d...

How to use apoc.periodic.iterate with apoc.merge.relationship

06-14-2020
Hello everyone, I'm using apoc.algo.dijkstra to compute shortest paths and then create new relationships with some computed properties. Here is my query: Call apoc.periodic.iterate( "Match (h:Hub:Airport),(a:Arrival) where h.code<>a.code Call apoc.a...

Shortest Paths algorithms

06-09-2020
Hello, I want to compute shortest paths for all pairs in my graph. I tried to use all pairs shortest paths and single shortest paths but both do not return paths like apoc dijkstra. I'm working in a graph with 4602 nodes and 80000 relationships. I ca...
Kudos given to