Network Topology Generator
Last update : 28/2/2007

dijkstra - Perform the shortest path between 2 nodes

Calling Sequence

[path]=dijkstra(g,typ,i,j)

Parameters

Description

Perform the shortest path between two nodes i and j of the graph g. typ can take the value 'arc'(in respect with the number of arcs belonging to the path) or 'length'(in respect with the path length). Path provides each node belonging to the shortest path.

Examples

[g,conn]=waxmanconnex(0.2,0.3,80,1000);
[path]=dijkstra(g,'arc',1,30);
  

Authors

Foued Melakessou University of Luxembourg

Bibliography

Intra Project 2004-2007

Used Function

dijkstra.