网络中一条边的两个端点度分别为D1和D2的统计程序

clear all;clc;
rand('state',10)
A=round(rand(10,10));
A=tril(A,-1)+tril(A,-1)';
[row,colum]=size(A);
EdgeDegree=[0,0,0];
for i=1:row
   for j=i:colum
       if A(i,j)==1
           SortByDegree=sort([sum(A(i,:)),  sum(A(:,j))]);
           Similar=(EdgeDegree(:,1)==SortByDegree(1))&(EdgeDegree(:,2)==SortByDegree(2));
           if sum(Similar)~=0
               Index=find(Similar==1);
               EdgeDegree(Index,3)=EdgeDegree(Index,3)+1;
           else
              EdgeDegree=[EdgeDegree; sort([sum(A(i,:)),  sum(A(:,j))]),1];
           end
       end
   end
end
EdgeDegree(:,3)=EdgeDegree(:,3)/sum(EdgeDegree(:,3));
EdgeDis=EdgeDegree(2:end,:)