x=ones(1,n);
checkbit=zeros(1,n);
nodedest=[1 1 2 3 6 2];
hopcount=zeros(1,n);

for i= 1: n
    for j=1:n
        if nodedest(j)==1 && checkbit(j)==0
            hopcount(j)=hopcount(j)+1;
            checkbit(j)=1;
        else
            x(j)=nodedest(j);
        end
        if x(j)~=1
            hopcount(j)=hopcount(j)+1;
            x(j)=nodedest(x(j));
        end
    end
end