clear all clc D=[0 6 inf inf 5 6 inf 5 inf 6 0 9 inf inf 9 inf 3 inf inf 9 0 7 inf inf 4 inf inf inf inf 7 0 6 4 6 inf 3 5 inf inf 6 0 5 inf inf 4 6 9 inf 4 5 0 5 inf inf inf inf 4 6 inf 5 0 inf inf 5 3 inf inf inf inf inf 0

Use openet network simulation. Function: initialize the entire network release path Dijkstra algorithm implementation query node routing table creation route selection order routing updates to establish a connection.-Use openet network simulation.

Using dijkstras algorith to find shortest path