I'm relatively new to neo4j and I'm not quite sure how to do more complex queries. I want to build a graph which in part is analogous to a file tree structure (
A node of a Round in a game is connected to Answer nodes. (:Round)<-[:IN_ROUND]-(:Answer) It is expected every Round to have 5 or fewer Answers related to it
So let's say that I have a graph with two node types: Source and Destination and relation FEEDS_INTO. Where Source nodes can have realtion between each other an
I'm trying to find all the relationships of the nodes which have one specific relationship. People can be connected to events which in turn are connected to chu
I have a database with 500K nodes and 700K relationships. I created 500 additional relationships with a new typeDummyEdge with edge_id attributes from "1" to "5
I'm trying to do something like this : Flow must have a relationship with : An Application OR A Partner My Flow must have one of these two relationships. I t
I want to fetch all 3rd level nodes(4,5,6 and 7 in below pic) and its relationships along with its parent node details In the below example: If I send ID : 7 t
load csv with headers from 'file:///C:/Users/user/Desktop/Neo4J' as row Create (:State_Code {state_cd:row.st_cd}) I have tried this code and it is throwing a
I recently started using neo4j and its query language "cypher" for working with building/metering data. My current graph database consists of different nodes (w
i want to use gds.alpha.similarity.jaccard from https://neo4j.com/docs/graph-data-science/current/alpha-algorithms/jaccard/, but cypher send a error Code: RETUR
We know that we can get the shortest path between nodes by the following statement MATCH p=allShortestPaths((a)-[*]->(b)) Is there any way to search for t