Dijkstra lowest cost for images
Finds the lowest cost path on an image from one point to another
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
1) Simple version of Dijkstra that supports sparse matrices as an input
2) im2graph for converting an image to graph representation (sparse distance matrix). Supports both 4 connected and 8 connected neighborhoods
Cite As
Y Simson (2026). Dijkstra lowest cost for images (https://in.mathworks.com/matlabcentral/fileexchange/46088-dijkstra-lowest-cost-for-images), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: dijkstra very simple, A solution to the Maze problem with Dijkstra
General Information
- Version 1.0.0.0 (2.88 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
