<< NARVAL_I_UpdateProbRoute NARVAL NARVAL_M_DijkstraMP >>

NARVAL >> NARVAL > NARVAL_M_Dijkstra

NARVAL_M_Dijkstra

Perform the Dijkstra's algorithm on a network topology from a source node.

Calling Sequence

[dist,pred]=NARVAL_M_Dijkstra(nodex,nodey,head,tail,ni)

Parameters

nodex :

nodes x-coordinates.

nodey :

nodes y-coordinates.

head :

links head vector.

tail :

links tail vector.

ni :

source node.

dist :

distance vector from the source node towards remaining network nodes.

pred :

predecessors vector to reach the source node from remaining network nodes.

Description

NARVAL_M_Dijkstra performs the Dijkstra's Algorithm from the source node ni on a network topology represented by 4 vectors: nodex, nodey, head and tail. dist and pred permit to reconstruct the shortest path between any network nodes towards the source node ni.

Examples

n=80;//network size
L=1000;//network square area side
dmax=100;//locality radius
[g]=NARVAL_T_LocalityConnex(n,L,dmax);//generation of a random topology in respect with the Locality method. 
i=NARVAL_F_Random(length(g.node_x));//selection of the source node
ind=1;
f=NARVAL_G_ShowGraph(g,ind);
c=5;//visualization parameters 
b=10;
d=30;
i2=2;//window index
[gc,f2]=NARVAL_G_ShowNodes(g,i,c,b,d,i2);
[dist,pred]=NARVAL_M_Dijkstra(g.node_x,g.node_y,g.head,g.tail,i);//Application of NARVAL_M_Dijkstra
i
dist
pred

Dependency

NARVAL_F_Remov, NARVAL_M_Neighborhood

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact

<< NARVAL_I_UpdateProbRoute NARVAL NARVAL_M_DijkstraMP >>