| 123456789101112131415161718192021222324252627282930313233343536373839404142434445 |
- function D=distance_bin(A)
- %DISTANCE_BIN Distance matrix
- %
- % D = distance_bin(A);
- %
- % The distance matrix contains lengths of shortest paths between all
- % pairs of nodes. An entry (u,v) represents the length of shortest path
- % from node u to node v. The average shortest path length is the
- % characteristic path length of the network.
- %
- % Input: A, binary directed/undirected connection matrix
- %
- % Output: D, distance matrix
- %
- % Notes:
- % Lengths between disconnected nodes are set to Inf.
- % Lengths on the main diagonal are set to 0.
- %
- % Algorithm: Algebraic shortest paths.
- %
- %
- % Mika Rubinov, U Cambridge
- % Jonathan Clayden, UCL
- % 2007-2013
- % Modification history:
- % 2007: Original (MR)
- % 2013: Bug fix, enforce zero distance for self-connections (JC)
- A=double(A~=0); %binarize and convert to double format
- l=1; %path length
- Lpath=A; %matrix of paths l
- D=A; %distance matrix
- Idx=true;
- while any(Idx(:))
- l=l+1;
- Lpath=Lpath*A;
- Idx=(Lpath~=0)&(D==0);
- D(Idx)=l;
- end
- D(~D)=inf; %assign inf to disconnected nodes
- D(1:length(A)+1:end)=0; %clear diagonal
|
