<< GraphDegDist Network Topology Generator JDD >>

Network Topology Generator >> Network Topology Generator > GraphDegDistWD

GraphDegDistWD

Perform the node degree distribution of a graph.

Calling Sequence

[d,dv]=GraphDegDistWD(g)

Parameters

g :

network graph.

d :

node degree distribution.

dv :

vector of each node degree.

Description

GraphDegDist performs the node degree distribution d of the graph g. The degree of each network node is stored in dv.

Examples

n=300;//network size
l0=5;//a maximum of 5 links are created for any created node
L=1000;//network square area side 
[g,d]=NtgBarabasiAlbert(n,l0,L);//generation of the topology
show_graph(g);
[d,dv]=GraphDegDistWD(g);//application of GraphDegDistWD
d
dv

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact


<< GraphDegDist Network Topology Generator JDD >>