dijkstra - Perform the shortest path between 2 nodes
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.
[g,conn]=waxmanconnex(0.2,0.3,80,1000); [path]=dijkstra(g,'arc',1,30);