How to determine shortest path to the CH?

1 次查看（过去 30 天）

显示更早的评论

Asyran Abdullah 2018-9-5

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/417746-how-to-determine-shortest-path-to-the-ch

在 MATLAB Online 中打开

Hi, i need some help, how to build the edge in random nodes and determine the shortest path to CH as following figure.

Code.

clc;
clear all;
N=10;
fontSize = 12;
data = rand(N,2); % Randomly generated n no. of nodes
x = data(:,2)*100;
y = data(:,1)*100;
plot(x, y, 'bo', 'LineWidth', 1, 'MarkerSize', 8);
grid on
axis square;
xlabel('X', 'FontSize', fontSize);
ylabel('Y', 'FontSize', fontSize);
for k = 1 : N
  text(x(k), y(k), num2str(k), 'FontSize', 12, 'Color', 'b');
end
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
ch1=ceil(rand(1)*N);
text(node(ch1).x,node(ch1).y,['CH1'],'Color' ,'r');
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