Dijkstra Algorithm Consistent with Cyclic Paths

This function and attached examples show finding shortest-paths (including cyclic paths) from a dire

Description

Given adjacent matrix (transmat) and starting/ending node (pathS, pathE), this function finds the shortest-path (path) that connecting pathS and pathE, and returns the cost (cost):

[path, cost]=dijkstra(pathS, pathE, transmat);

NOTE: Except for the simple interface, the pathS and pathE can be the same node, i.e., this implementation can find _cyclic_ paths.

Acknowledgements

The author wishes to acknowledge the following in the creation of this submission:
Dijkstra Shortest Path Routing

• MATLAB release: MATLAB 7 (R14)

[xialing wu]

It is simple and effective. But I have 2 confusions:
1) Subprogram 1 has no relationship with Subprogram 2.
2) The 2nd result: Cycle from 2 -> 2 and Cycle from 3 -> 3 are same cycle.Why here name them as different?

[David Lusseau]

 

[David Lusseau]

There is one problem: the algorithm does not deal with duplicate path. That is if there are more than 1 path with the same minimal cost it only finds one of them.

[Will Gikandi]

Very good. Quick and efficient. As a newbie, I could have used a little more info on in the documentation. But still very very good.

[Sergey Seleznev]

Thanks, very useful!

[Student Alexander]

Sorry, but the 1 path problem is VERY consistent

[Olivier Planchon]

The good things: The code is simple to understand and to use. Only one function in one file. Short code. And it works.
 
The less good: Massive use of embeded loops make the code very slow. Some of them are really EZ to chnage into more efficient MATLAB code. Others need more work.

My conclusion: This function have met my (simple) needs. Many thanks. Olivier

[w l]

 

[rakesh nune]

The code is really simple and i have used it for creating a new algorithm

[vijayan duraiswamy]

The code is really useful and i have used and modified for my application

[Choi Uk]

good algorithm!!! thx!!

[Arun Kumar Mondal]

good