How get adjacency matrix from this code

N = input('no. of Nodes');
p = input('Give the possibility');
m = (n*(n-1))/2;

degree=zeros(N,1);
position=zeros(N,2);
 
for m=1:N
    position(m,1)=cos(m/N*2*pi);
    position(m,2)=sin(m/N*2*pi);
end
 

hold on;
plot(position(:,1),position(:,2),'d')
 
for m=1:N
    for n=m+1:N
        if(rand(1,1)<p)
            degree(m,1)=degree(m,1)+1;
            degree(n,1)=degree(n,1)+1;
            plot(position([m,n],1),position([m,n],2))
        end
    end
end
hold off;

Answer 1

[Stephan]

I would recommend to use the inbuilt functions for working with graphs - it makes life much easier:

N = input('no. of Nodes');
p = input('Give the possibility');

% Make adjacency matrix
idx = find(triu(ones(N),1));
V = rand(((N-1)*N)/2,1)<p;
A = zeros(N);
A(idx) = V;
A = A + triu(A,1)';

% create and plot undirected graph object
g = graph(A)
plot(g)

A good start for reading is here:

https://de.mathworks.com/help/matlab/graph-and-network-algorithms.html?s_tid=CRUX_lftnav

[Konstantinos koutsikakis]

Your code is for random graph ( Erdos-Renye graph)?

[Stephan]

Like your code it produces random edges between knots with a given probability.

[Konstantinos koutsikakis]

ok. how to print points in the form of a circle and a adjacency matrix

[Walter Roberson]

https://www.mathworks.com/help/matlab/ref/matlab.graphics.chart.primitive.graphplot.layout.html#d122e485652