How to find out number of source nodes and average indegree of a source node in directed graph?
3 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Mouli Sarkar
le 2 Août 2021
Commenté : Srijith Kasaragod
le 6 Août 2021
I have a dataset from which I have created a directed graph.
How I want to find out indegree of source nodes and number of source node. And want to do the same thing for target nodes of that directed graph.
Here is my code.
m = readtable('rough.csv')
col1= m{:,1}
col2= m{:,2}
col3= m{:,3}
g= digraph(col1,col2,col3)
plot(g,'Layout','force','EdgeLabel',g.Edges.Weight)
0 commentaires
Réponse acceptée
Srijith Kasaragod
le 5 Août 2021
As per my understanding you have a directed graph and you want to compute indegree and number of source and target nodes. The following lines of code shows one of the possible ways:
%store edges and nodes into variables
edges= g.Edges;
nodes= g.Nodes;
%filter out source and target nodes from edges
s= unique([edges{:,1}(:,1)])
t= unique([edges{:,1}(:,2)])
%input graph and source or target nodes into ‘indegree’ function
in_deg_s= indegree(g,s);
in_deg_t= indegree(g,t);
%count the number of source and target nodes
no_source= numel(s);
no_target= numel(t);
2 commentaires
Srijith Kasaragod
le 6 Août 2021
@Mouli Sarkar I recommend you create another post for this question to get a faster response.
Plus de réponses (0)
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!