dijkstra very simple

Version 1.0.0.0 (868 Bytes) by Jorge Barrera

Dijkstra's algorithm to find the shortest path

14.9K Downloads

Updated 16 Apr 2007

No License

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://in.mathworks.com/matlabcentral/fileexchange/14661-dijkstra-very-simple), MATLAB Central File Exchange. Retrieved January 20, 2026.

MATLAB Release Compatibility

Created with R14SP3

Compatible with any release

Platform Compatibility

Windows macOS Linux

Tags Add Tags

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

dijkstra.m

Version	Published	Release Notes
1.0.0.0	16 Apr 2007		Download