Azzera filtri
Azzera filtri

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

2 visualizzazioni (ultimi 30 giorni)
Roy Goodman
Roy Goodman il 6 Feb 2017
Risposto: Christine Tobler il 21 Feb 2017
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 Commento
Sindhu Priya
Sindhu Priya il 14 Feb 2017
I am not aware if there is a built in function for finding the predecessor and successor edges of a digraph.

Accedi per commentare.

Risposte (1)

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


Scopri di più su Graph and Network Algorithms in Help Center e File Exchange

Community Treasure Hunt

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

Start Hunting!

Translated by