代码搜索结果

function D=G2D(G) %Construct Adjacency Matrix by path graph % G is matrix of 0 and 1, 1 represents obstacles a=1; N=size(G,1); D=inf*ones(N^2,N^2); for i=1:(N^2) x=ceil(i/N-0.00001);