How to find all possible path to destination?

Question

Asyran Abdullah 2018-8-25

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/416153-how-to-find-all-possible-path-to-destination

回答： Walter Roberson 2018-8-27

Hi,

The clusterhead is already selected based on the distance value. However there is a problem to make connect a node to the clusterhead. I want to make a path from 4-9-1-3-5-CH, another route is 8-9-1-3-5-CH, 10-2-CH and 7-CH.

if true
%%%%%%%%%%%%%%%
  clc;
clear all; 
N=10;               % No of nodes
data = rand(N,2);   % Randomly generated n no. of nodes
x = data(:,1)*100;
y = data(:,2)*100;
numEdge = 19;   
plot(x,y,'rx');      
node=struct('id',{},'x',{},'y',{},'dist',{},'link',{'1'});
for i=1:N
node(i).id=i;
node(i).x=x(i);
node(i).y=y(i);
text(x(i),y(i),num2str(i));
end
%%%%%%%%%%%%%%%%%%
% CH
ch1=ceil(rand(1)*N);
text(node(ch1).x,node(ch1).y,['CH'],'Color' ,'b');
for  i = 1:N
  node(i).dist = sqrt(((node(ch1).x - node(i).x)^2 + (node(ch1).y - node(i).y)^2));
  a(i)=node(i).dist;
disp(node(i).dist);
end
A=sort(a,'descend');
a=1;
  for i = 1:N
        node_distance(a) = node(i).dist;
        a = a+1;
  end
Maximum_distance = max(node_distance);
  for i = 1:N
      if node(i).dist == max(node_distance)
          next_header = node(i).id;
      end
end
end