how can i calculate the degree of node?

how can i calculate the degree of node?

want to wait until i have calculated the degree for every node and then once that has been completed, find that node with the maximum degree and minimum distance to the sink. and plot the node

if (d<(handles.r))&&(i~=j)
   degree(i)=degree(i)+1;% CALCULE LEs nombre de neighbord( DEGRE) DES NOEUDS REDONDANTS
   disp(degree(i))
   if (max(degree))%&&(min(handles.d_sink))
       plot([X1,X2],[Y1,Y2],'o','LineWidth',0.1);
       grid on;
   end
end

plzzzzz need help

Answer 1

[Steven Lord]

Are you using one of the graph or digraph objects introduced in release R2015b? If so look at the DEGREE (for graph) or INDEGREE/OUTDEGREE (for digraph) functions listed on that documentation page.

[ali hadjer]

no not the degree of graph i dont use the graph juste the point scatter in the area