密码查询复合关系匹配

Question

with a graph successfully matching

MATCH (a:A)-[x:X]-(b:B)-[y:Y]-(c:C) RETURN *

is it possible to return something like

(a:A)-[z:Z]-(c:C)

which has a 'new' relationship z (let's call it 'linked via a B') that does not exist in the graph database, and that in effect represents a collapsing of

-[x:X]-(b:B)-[y:Y]- 

to

-[z:Z]-

Note, that the relationship -[z:Z]- does not exist in the graph.

Possible? What would the cypher look like?

thanks

Answer 1

This is possible with virtual relationships via APOC Procedures :

MATCH (a:A)-[x:X]-(b:B)-[y:Y]-(c:C)
CALL apoc.create.vRelationship(a,'Z',{}, c) YIELD rel
RETURN a, rel, c