<< DisplayGraph Network Topology Generator Related EU Project >>

Network Topology Generator >> Network Topology Generator > Distance

Distance

Perform the Euclidian distance between two network nodes of a graph.

Calling Sequence

[d]=Distance(n1,n2,nx,ny)

Parameters

n1 :

network node.

n2 :

network node.

nx :

x-coordinates of network nodes.

ny :

y-coordinates of network nodes.

Description

Distance calculates the Euclidian distance between two network nodes n1 and n2. The network nodes coordinates are assumed to be stored inside the vectors nx and ny.

Examples

n=80;//network size
L=1000;//network square area side
dmax=100;//locality radius
[g]=NtgLocalityConnex(n,L,dmax);//generation of a random topology in respect with the Locality method. 
N=length(g.node_x);//real network size
[n1,n2]=Random_i_j(N);//selection of two distinct nodes
nd=ones(1,n);//display the graph
nc=ones(1,n);
nd([n1 n2])=3;
nc([n1 n2])=5;
g.node_border=nd;
g.node_color=nc;
show_graph(g);
[d]=Distance(n1,n2,g.node_x,g.node_y);//application of Distance
n1
n2
d

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact


<< DisplayGraph Network Topology Generator Related EU Project >>