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

1 view (last 30 days)
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.
  1 Comment
Sindhu Priya
Sindhu Priya on 14 Feb 2017
I am not aware if there is a built in function for finding the predecessor and successor edges of a digraph.

Sign in to comment.

Answers (1)

Christine Tobler
Christine Tobler on 21 Feb 2017
There is currently no builtin for this, your lines with findedge are the simplest way to get the edge indices.


Find more on Graph and Network Algorithms in Help Center and File Exchange

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by