All edges attached to given node in a (di)graph

I have a simple and, I imagine, common question about working with graphs. Is there a built-in way to find all the edges pointing into and out of a given node. I can use this

outgoing = findedge(G,1,successors(G,1));

incoming = findedge(G,1,predecessors(G,1));

but I would think there's something built in.

[Sindhu Priya]

I am not aware if there is a built in function for finding the predecessor and successor edges of a digraph.

Regards,

Sindhu

Answer 1

[Christine Tobler]

There is currently no builtin for this, your lines with findedge are the simplest way to get the edge indices.