Dijkstra's Shortest Path Algorithm

calculates the shortest path and distance between two nodes on a map

Description

This function can
    1. Find the shortest path and distance from a starting node to an ending node on a map**
    2. Find the shortest paths and distances from a starting node to ALL other nodes on a map**

**The map should consist of nodes and segments, such that:
    1. nodes have the format [ID X Y] or [ID X Y Z] (with ID being an integer, and X,Y,Z representing position coordinates and of type double)
    2. segments have the format [ID N1 N2] (with ID being an integer, and N1 N2 representing IDs from the nodes list such that there is an [undirected] edge/segment between node N1 and node N2, and obviously of integer type also)

Note:
    The function generates a random map of nodes and segments that it uses if no inputs are given. This way, it acts like a script if it is run with no inputs, and it acts like a function otherwise.

Acknowledgements

Dijkstra Shortest Path Routing inspired this file.

This file inspired Advanced Dijkstra's Minimum Path Algorithm.

• MATLAB release: MATLAB 7.3 (R2006b)

[Andrea]

 

[Jesus Luevano]

Hi, when I try to use the algorithm to optimization route, always it asks me the segments from the nodes, what happens if I do not know them, because I trying to get the optmization route of an image.

by the way, I do not understand the CMatrix relationship with the real image on the biograph function.

[Xilu Wang]

 

[Benjamin Knight]

Great code, well documented and easy to apply. Note that I needed to transpose A and C matrices to get a result from this function.

[abdullah rfdgsdf]

Perfect >> thank u man ... go head

[Michael Ashby]

Very useful code for finding the distances from a given node to all the others.
Thanks to the author for assistance and updates.

[Weihao Yin]

 

[Kuba Wu]

 

[ioannis tsolakidis]

 

[Charles Kingston]

This already exist in one of the matlab demos.

[Nikhil M]

Very Good; Thanks;

[The Author]

Chuthamart - If you're going to give a rating of 1, an explanation would be nice...

[Chuthamart Panklin]

 

[Omer KAMAL]

can u make it for 7 nodes to see the output.

[Bandi Reddy]

 

[han daza]

works like a charm!! quite fast, in my case 342 nodes (708 segments) ~ 0.3 secs. it even works if the nodes you feed in are not all used by the segments !! thanks

[titin siburian]

i think this program is really good.

[Daren O'Connor]

Great! Fast, efficient, and easy to use.