<< NL_G_GraphDegreeDist NL_G: Graph NL_G_GraphEdgesLength >>

NARVAL >> NL_G: Graph > NL_G_GraphDegreeDistPlot

NL_G_GraphDegreeDistPlot

Perform the node degree distribution of a graph (visualization).

Calling Sequence

[D,V] = NL_G_GraphDegreeDist(G,I)

Arguments

G :

Graph.

I :

Window index.

D :

Node degree distribution.

V :

Node degree vector.

Description

NL_G_GraphDegreeDist performs the node degree distribution D of the graph G. The degree (quantity of neighbors) of each network node is stored in V. The distribution is displayed inside the window I.

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]=NL_T_BarabasiAlbert(n,l0,L);//generation of the topology
ind=1;//window index
[f]=NL_G_ShowGraph(g,ind);//graph visualization
i=2;//window index
[d,dv]=NL_G_GraphDegreeDistPlot(g,i);//application of NL_G_GraphDegreeDistPlot

Dependency

NL_G_NodeNeighbors

Report an issue
<< NL_G_GraphDegreeDist NL_G: Graph NL_G_GraphEdgesLength >>