How Do I Remove Edge about arangolite

[solher]

To be honest, I also don't really understand why the ArangoDB team never implemented some kind of delete cascade.

The remove vertex operation from the graph management interface is Javascript so I would not consider it as a viable option in a Go program (but I did it with the transactions so why not...).
The Javascript API is still way ahead of AQL (for example the transactions that can only be done using Javascript right now) but they are working hard on implementing everything natively for AQL and ArangoDB 3.0 should be a great step towards that.

[didasy]

Yea, it feels really incomplete right now when AQL doesn't have the same capability as the JS interface.

I think I should get the edge first somehow to get the key, then do a Send to DELETE /_api/edge/{col}/{key}.

Thought?

[solher]

Actually, the best solution I found for now is using the AQL traversals like that:

    t := arangolite.NewTransaction(
        nil,
        []string{"users","dashboards","dashboardRights","devices","deviceRights"},
     ).AddQuery("users", `
        FOR u IN users
        REMOVE u IN users
        RETURN u
    `).AddQuery("", `
        FOR u IN {{.users}}
            FOR v,e IN OUTBOUND u dashboardRights, deviceRights
            REMOVE v IN dashboards OPTIONS { ignoreErrors: true }
            REMOVE e IN dashboardRights OPTIONS { ignoreErrors: true }
            REMOVE v IN devices OPTIONS { ignoreErrors: true }
            REMOVE e IN deviceRights OPTIONS { ignoreErrors: true }
    `).Return("users")

The thing which is not cool is that we have to statically indicate the collection in which we want to remove a vertex/edge. So here we have basically to try every possibility. Still not very beautiful haha.

[didasy]

Seems complicated for a task so simple.

I think I need to learn AQL more to totally understand what's going on in that query.

[solher]

Yeah I know and I totally agree with you. There should be some simple way to cascade when there's a deletion...