MATLAB: K-th order neighbors in graph

graphgraph theoryMATLAB

I would like to do this, but in Matlab with a graph (it is not a directed graph): https://stackoverflow.com/questions/18393842/k-th-order-neighbors-in-graph-python-networkx
I have a graph in which I want to efficiently find a list of all K-th order neighbors of a node (j). K-th order neighbors are defined as all nodes which can be reached from the node in question in exactly K hops.
For example,
s = [1 1 1 1 2 2 2 2 2 8 8 12 6];
t = [3 5 4 2 6 10 7 9 8 11 12 13 7];
G = graph(s,t);
plot(G)
If j=1, I want to get :
for k=1
[2 3 4 5]
for k=2
[6 7 8 9 10]
for k=3 
[11 12]
k=4 
[13]
k=5
empthy

Best Answer

function  result=distk(G,i,k)
%  G -graph
%  i - start node
%  k - number of steps
   A=adjacency(G);
    v=A(i,:);
    prior=false(size(v)); prior(i)=true;
    for n=1:k-1
       prior=prior|v;
       v=v*A;
    end
    
    result  = find(v&~prior);
    
end
Related Question