Which Dijkstra code is best out of all these in comparison to this method?

In relation to the following method (graph searching/traversal? I think?):

https://www.youtube.com/watch?v=5GT5hYzjNoo

Which out of all these following matlab code files in the below link if any of them, would achieve the same results, as in the table they have drawn out, as shown in this video?

http://strategic.mit.edu/downloads.php?page=matlab_networks

Is there anything better out there that achieves this in matlab if none of them e.g. via the add on explorer?

Answer 1

[Image Analyst]

There is a shortestpath() function.

[Jamie Cropley]

In which file in relation to my initial question?

[Image Analyst]

I'm not familiar with the MIT files. But you asked if there were any MATLAB functions "that achieves this in matlab". And, yes, I think there are. At least there is a shortest path function. And it's already built into base MATLAB. Does it not do what you want?

[Jamie Cropley]

Yeah I gave it a go and it solved my issue, I just wanted to check something was correct.

Many thanks.