dist_full2sparse.m

来自「best routing protocol」· M 代码 · 共 20 行

function S = dist_full2sparse(D)
%D: neighbor_dist matrix
debug = 1;
if issparse(D)
  error('already a sparse matrix');
end
n = length(D);
if debug
  fprintf('coverting to a sparse matrix\n');
end
tmp = find(D==Inf);
D(find(D==Inf))=zeros(length(tmp),1);
for i=1:n
  D(i,i)=0;
end
S = sparse(D);
if debug
  fprintf('finished coverting to a sparse matrix\n');
end