How can I get all the routes between two nodes so that each route does not repeat nodes?

[DmitriyKlaes]

General Question

[egasimov]

A path is a finite sequence of edges. Neither vertices nor edges can be repeatedly visited in graph traversal.

It looks like Path is what you are looking for. Check doc for details

[DmitriyKlaes]

A path is a finite sequence of edges. Neither vertices nor edges can be repeatedly visited in graph traversal.

It looks like Path is what you are looking for. Check doc for details

Yes, it looks like a path. But I can't find in the documentation how to get path... there is only walk and trail

[DipakHalkude]

NebulaGraph / Cypher-like Query

Some graph DBs (like Neo4j or NebulaGraph) support path traversal:

MATCH p = (a:Node {id: 'A'})-[*]->(b:Node {id: 'D'})
WHERE NONE(n IN nodes(p) WHERE size([x IN nodes(p) WHERE x = n]) > 1)
RETURN p

[*] → variable-length path

NONE(...) → ensures nodes are not repeated

nodes(p) → list of nodes in the path