Assume a simplistic graph created by:
merge (n:Node {name: "x"})
merge (m:Node {name: "y"})
merge (n)-[:R]->(m)
merge (n)-[:R {k: "v"}]->(m)
return n, m
Naturally, I can delete both edges via:
match (n:Node {name: "x"})
match (m:Node {name: "y"})
ma...
