Remove all edges from A to B

Hi!

I wonder if is there a way to delete all edges from node A to node B in a single request?

I tried

delete {
    <0xA-uid> * <0xB-uid>
}

and it doesn’t work (expectedly though). What would you suggest for this simple task?

Today you need to do it manually, but we gonna have a new type of transaction that may be very useful for this.

You’ll need to query for all relations between the edges. And if need to delete also the nodes, You’ll need with same query to collect the UIDs of these nodes to delete them. And then handle the queries results to build the deletion mutation.

Let’s see the new transaction, it promises a lot.

https://github.com/dgraph-io/dgraph/pull/3197

Cheers.