Filter löschen
Filter löschen

Error in ploting the network graph?how to make the code run??

1 Ansicht (letzte 30 Tage)
Sneha Kolapalli
Sneha Kolapalli am 10 Apr. 2017
Kommentiert: Walter Roberson am 12 Apr. 2017
n=10;
L=5;
B=4;
A=[L B];
% non-overlap distance > 5
distinct_BOUND = 2;
Z = zeros(n,2);
T = rand(1,2).*A;
Z(1,:) = T;
for i = 2:n
T = rand(1,2).*A;
for j = 1:i-1
while pdist([T;Z(j,:)],'euclidean') < distinct_BOUND
T = rand(1,2).*A;
end
end
Z(i,:) = T;
end
z=round(Z);
x=z(:,1);
y=z(:,2);
d=zeros(n,n-1);
% here we set the transmitting range tr=4
tr=4;
for i=1:n
for j=(i+1):n
Xi=x(i,:);
Yi=y(i,:);
Xj=x(j,:);
Yj=y(j,:);
X = [Xi,Yi;Xj,Yj];
d(i,j) =round( pdist(X,'euclidean'));
end
end
N=round((n*n-1)/2)
s=zeros(1,N);
t=zeros(1,N);
weights=zeros(1,N);
for i=1:n
for j=(i+1):n
if d(i,j)<tr
k=1;
D(1,k)=d(i,j);
s(1,k)=i;
t(1,k)=j;
end
k=k+1;
end
end
G = graph(s,t,weights)
figure(3)
plot(G)
  5 Kommentare
Sneha Kolapalli
Sneha Kolapalli am 11 Apr. 2017
yes.But how do I remove those zero values from the s,t ,weights.
Walter Roberson
Walter Roberson am 12 Apr. 2017
Do you want the 0s to indicate there is no connection?

Melden Sie sich an, um zu kommentieren.

Antworten (0)

Kategorien

Mehr zu Graph and Network Algorithms finden Sie in Help Center und File Exchange

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by