How to find relationship between two nodes?

Users GraphQL
4

Thanks for your quick response, looking forward to the issue resolved, but expand cannot get shortest path, right?
Another question, if I want to find all predicates on shortest path between 2 nodes, I am wondering if this way could resolve hard typing problem: I create a new edge for each predicate, with fixed name like “fakedEdge” along with a facet “name” whose value is real predicate. Then use k-shortest path query to get all fakedEdge and its facet @facet(name).

{
  path as shortest(from: 0x2, to: 0x5) {
    fakedEdge @facet(name)
  }

  path(func: uid(path)) {
     name
  }
}

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.