dijkstra very simple

dijkstra's algorithm to fid the shortest path

Description

This is an implementation of the dijkstra´s algorithm, which finds the minimal cost path between two nodes. It´s supposed to solve the problem on
positive weighted instances.

Acknowledgements

The author wishes to acknowledge the following in the creation of this submission:
Dijkstra Shortest Path Routing
This submission has inspired the following:
Modified Dijsktra's Algorithm to return all paths that tie for shortest

• MATLAB release: MATLAB 7.1.0 (R14SP3)

[Dimitri Strobbe]

I loved this! Not too much information about the algorithm itself (dijkstra), but very nice and helpfull for my thesis!
Thanks!

[Dimitri Strobbe]

I loved this! Not too much information about the algorithm itself (dijkstra), but very nice and helpfull for my thesis!
Thanks!

[Dominik Kaspar]

A convenient implementation of Dijkstra's Shortest Paths algorithm.

[li li]

need it to research

[Petr]

Any information about the inputs and outputs of dijkstra's algorithm. Can you present an example? Thanks!

[cynthia]

matriz_costo means?

[Yannos M]

script should be removed! One of the worst documentations ever..and very bad English.what is the size of s,d, matriz_costo???

[Chua]

gud

[Frederick]

For the people who look for input:
matriz_costo is the adjacency matrix (n by n matrix with distance or cost from one point/node to another
s is startnode
d is endnode

[David B]

This is great code. As others have pointed out, it could be commented better, but having said that, it's the easiest implementation of Dijkstra's Algorithm to understand that is available on the file exchange. As a beginner programmer, I appreciate the simplicity.

The previous commenter pointed out, matriz-costo is an n x n adjacency matrix. To elaborate, elements reflect the cost of traveling between corresponding nodes. Any element set to zero implies a cost-free path exists between those two nodes. I usually set the elements corresponding to non-adjacent nodes to an arbitrarily large number (it might also work to set them to inf -- I haven't tried it).

My one wish is that the output included multiple paths if there is a tie for which path is shortest. I modified the code to return ties. It is posted here:

http://www.mathworks.com/matlabcentral/fileexchange/36086

Thank you!!