dijkstra very simple

Dijkstra's algorithm to find the shortest path

Jorge Barrera

Version 1.0.0.0 (868 Bytes)

14.9K Downloads

(9)

16 Apr 2007

Download

Open in MATLAB Online

Download

Open in MATLAB Online

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.

Cite As

Jorge Barrera (2026). dijkstra very simple (https://uk.mathworks.com/matlabcentral/fileexchange/14661-dijkstra-very-simple), MATLAB Central File Exchange. Retrieved April 25, 2026.

Acknowledgements

Inspired by: Dijkstra Shortest Path Routing

Inspired: JHF_Dijkstra-Algorithm_withUserHandling, Modified Dijsktra's Algorithm to return all paths that tie for shortest, A solution to the Maze problem with Dijkstra, Dijkstra lowest cost for images

General Information

Version 1.0.0.0 (868 Bytes)
No License

MATLAB Release Compatibility

Compatible with any release

Platform Compatibility

Windows
macOS
Linux

Open in new tab

Version	Published	Release Notes	Action
1.0.0.0	16 Apr 2007		Download