Network Topology Generator
Last update : 1/3/2007

routing_n_dijkstra - Perform 5 routing tables with the n-modified Dijkstra's algorithm

Calling Sequence

[table_routage_1,table_routage_2,table_routage_3,table_routage_4,table_routage_5]=routing_n_dijkstra(g,L,name)

Parameters

Description

Perform 5 routing table with the n-modified Dijkstra's algorithm. They give distinct routes for a connection between two network nodes.

Examples

  D=300;
  L=1000;
  n=30;
  [g]=ntg_locality(D,L,n);
  g=weightgraph(g);  
  [table_routage_1,table_routage_2,table_routage_3,table_routage_4,table_routage_5]=routing_n_dijkstra(g,L,'test.dat');
  

Authors

Foued Melakessou University of Luxembourg

Bibliography

Intra Project 2004-2007

Used Function

dijkstra, modifypathweight, rvector, diffvectors.

See Also

dijkstra ,   modifypathweight ,   rvector ,   diffvectors ,