dijkstra very simple

version (868 Bytes) by Jorge Barrera
Dijkstra's algorithm to find the shortest path


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 (2022). dijkstra very simple (https://www.mathworks.com/matlabcentral/fileexchange/14661-dijkstra-very-simple), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R14SP3
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!