All edges attached to given node in a (di)graph
1 vue (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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 commentaire
Sindhu Priya
le 14 Fév 2017
I am not aware if there is a built in function for finding the predecessor and successor edges of a digraph.
Regards,
Sindhu
Réponses (1)
Christine Tobler
le 21 Fév 2017
There is currently no builtin for this, your lines with findedge are the simplest way to get the edge indices.
0 commentaires
Voir également
Catégories
En savoir plus sur Graph and Network Algorithms dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!