Neo4j

wapst · 09-22-2022

I and trying to parse the result of a shortest path i have projected a graph - set all relationships to "UNDIRECTED" run the following algorithm CALL gds.shortestPath.dijkstra.stream( the result is a list of node ids. I am new to cypher - and cannot ...

wapst · 09-23-2022

I mocked up a scenario with the same outcome: merge (C:Person {name:'Mary'})merge (D:Person {name:'Bob'})merge (E:Person {name:'Jenny'})merge (F:Ride {type:'Coaster'})merge (G:Ride {type:'Spinny Thing'})merge (H:Ride {type:'Ring Toss'})merge (L:Locat...

wapst · 09-22-2022

Thank you for the quick reply! I am certainly on the right path based on your feedback.. but I think i am still missing something When i do "type(rel)" the output for all items in the path is "PATH 0" or (1,2,3 depending on the algorithm) in my exa...

Neo4j

User Statistics

User Activity

Return a relationship Label in shortest Path

Re: Return a relationship Label in shortest Path

Re: Return a relationship Label in shortest Path