Path finding in cypher query

Hi everyone,

I have a question about how it works a traversal operation in a cypher query. The search starts by finding the start point. After that, the relationships are traversed. This traverse is it done in parallel or sequently?

Thank you

Looks like I answered in the users slack, but I'll reply here too.

Cypher uses DFS expansion by default, but when you use shortestPath() or shortestPaths() then it uses a bidirectional BFS expansion from both the start and end nodes.