How to find relationship between two nodes?

[MichelDiz]

@catslink

but expand cannot get shortest path, right?

Nope, shortest path is a very unique type of query. You can’t do some things inside of it.

@catslink

if I want to find all predicates on shortest path between 2 nodes

All predicates you can’t. You can find relationships on known edges. To find all predicates you have to use recurse with filters.

@catslink

Also k-shortest path query or expand(User) @filter(uid(M)) is expected to support query by multiple nodes using func:eq(name, “aa”) as neo4j already supports, which is also useful in practice.

Not sure if I followed.