%% In-degree of All Graph Nodes
% Create and plot a directed graph, and then compute the in-degree of every node in the graph. The in-degree of a node is equal to the number of edges with that node as the target.

s = [1 3 2 2 4 5 1 2];
t = [2 2 4 5 6 6 6 6];
G = digraph(s,t);
plot(G)

%

indeg = indegree(G)

% indeg(j) indicates the in-degree of node j.
% Copyright 2015 The MathWorks, Inc.