Dijkstra Shortest Path Routing

This function and example show shortest path routing based on Dijkstra algorithm.

Description

This function performs Dijkstra algorithm based on the cost matrix, and shortest path can be found.

• Acknowledgements: This submission has inspired the following:; Probabilistic Flooding Simulation, A-star Search Algorithm, dijkstra very simple, Dijkstra Algorithm Consistent with Cyclic Paths, Dijkstra's Shortest Path Algorithm
• MATLAB release: MATLAB 6.0 (R12)

[lili Woo]

It is good that results are showed.

[Andrew Wagner]

Worked beautifully. Not sure what the last couple parameters are for, but they can be initialized according the the commented out usage example at the top of the file.

[egis cioperiux]

 

[sanith Wijesinghe]

 

[Babis Grouzakis]

excellent work,i have to study it carefully,step by step.

[Alg Searcher]

 

[samy jojo]

not too bad

[lydiah asere]

 

[achilles boursianis]

 

[john bautista]

very good

[An Vincint]

I appreciate it very much!

[Joseph Kirk]

This was very nice and I wanted to give it a 5, but when I changed the random state a couple times, the algorithm did not always find the shortest path... so I wonder if there is a bug that need to be fixed? (rand states = 1, 2, 4, 8 and 10 were the ones I checked that appeared to have an obviously shorter route than the one shown)

[Shahzada Rasool]

good example, but farthestNextHop and PreviousHop should be explained

[Eyup Cinar]

Good! but can be excellent with more comments and details inside the codes.It would be better to see more explanatory m file here.

[Brevetti Ge]

I'm Italian...
what are "farthest..." , "...previous?"...
Help me, please...

[shankar velmurugan]

good but need more comments to explain the m file

[hanan soliman]

 

[momo juju]

 

[chrystal Amutha]

good

[khld ab]

 

[neha r]

good

[ai yu]

very good

[Rolf Bartstra]

Poor (or no!) description of input/output parameters. For large nr of nodes, n, the netCostMatrix (nxn) may require vast amounts of memory; a link-based description may be more appropriate in this case (e.g. algorithm by Joseph Kirk)

[avdo tukic]

 

[Maxime]

 

[Alexander Wallar]

im new to MATLAB and i was just wondering if you could give an example?

[Ying liu]

 

[Matthew Bays]

Worked great the first time!

[Rick]

 

[Seifi]

I met this Error in running the code:

??? Index exceeds matrix dimensions.
Error in ==> dijkstra at 77
  if ( ( netCostMatrix(u, v) + distance(u)) < distance(v) )

Could you please tell me how do you define the input?

[Chandra Kurniawan]

wonderfull

[giorgio]

 

[giorgio]

 

[LA]

 

[Fardeen]

well done

[Hakk1]

well

[Meg]

can you please define the input such as farthestPreviousHop, farthestNextHop, and netcostmatrix?

[MAOFAN]

Well done