A solution to the Maze problem with Dijkstra

Version 1.1.0.0 (2,21 KB) von Y Simson
Use Dijkstra to find the shortest path to a Maze
4.0
(3)
1K Downloads
Aktualisiert 31. Mär 2014

Lizenz anzeigen

The general idea:
1) Think of every pixel in the maze as node on a connected graph
2) Define the walls as having high weights. This ensures that walls will act as separators
3) Use a 4-connected neighborhood to link adjacent pixels/nodes
4) Convert the maze image into a sparse Distance matrix(similar to an adjacency matrix with weights instead of ones).
5) Use graphshortestpath() from the bioinformatics toolbox to find the shortest path

Zitieren als

Y Simson (2024). A solution to the Maze problem with Dijkstra (https://www.mathworks.com/matlabcentral/fileexchange/46072-a-solution-to-the-maze-problem-with-dijkstra), MATLAB Central File Exchange. Abgerufen .

Kompatibilität der MATLAB-Version
Erstellt mit R2013a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Quellenangaben

Inspiriert von: dijkstra very simple

Inspiriert: Dijkstra lowest cost for images

Community Treasure Hunt

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

Start Hunting!

Version Veröffentlicht Versionshinweise
1.1.0.0

Fixed a bug and added support to im2graph() function to support 8 as well as 4 connected neighborhoods
1.0.0.0