neighbor algorithm cannot find nodes over 2 hops #432
Labels
bug
bug
community
community
Effort - Low
Effort - Low
Frequency - Monthly
Frequency - Monthly
Priority - Later
Priority - Later
Reach - VeryFew
Reach - VeryFew
Severity - S3
Severity - S3
Memgraph version
2.12.1
Environment
memgraph running on docker
Describe the bug
I created a very simple graph that looks like this:
When running this query to find neighbors of Paper_id nodes:
"MATCH (p:Paper_id {id: "710.4637"})
CALL neighbors.at_hop(p, ["connected"], 1) YIELD nodes
RETURN nodes;"
I'm able to get the correct results.
However, when I try to get nodes that are 2 hops away, there was nothing returned.
If I use the results I found from the first hop, I'm able to get the results, this means that the edges are correctly created, yet I can't retrieve the results.
The "connected" relations are created using my csv files:
LOAD CSV FROM "/usr/work_space/data/csvs/author_edges.csv" WITH HEADER AS row
CREATE (n1:Paper_id {id: row.paper_id})-[:connected]->(n2:Author {id: row.author});
The text was updated successfully, but these errors were encountered: