Travel Guide (GridLess Based Djikstra Algorithm)

Player need to Define Map & 2 Points to get Shortest Distance.
764 Downloads
Aktualisiert 9. Mär 2011

Lizenz anzeigen

Description of Game:

Objective: Shortest Distance Path between 2 Points.

Step 1: Define the Map using the GRID Points Only.
Step 2: Define the 2 Points to get Shortest Distance Path.

Note 1: For every click a Straight Line is drawn to its previous Point.
Note 2: "Loop" is used for a different Route Selection definition.
Note 3: "Travel" is used to Define 2 Points for a defined Map by user.
Note 4: Background Image is just a reference (no connection with Code).

Zitieren als

Krishna Lalith (2024). Travel Guide (GridLess Based Djikstra Algorithm) (https://www.mathworks.com/matlabcentral/fileexchange/30707-travel-guide-gridless-based-djikstra-algorithm), MATLAB Central File Exchange. Abgerufen .

Kompatibilität der MATLAB-Version
Erstellt mit R2007b
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Kategorien
Mehr zu Graph and Network Algorithms finden Sie in Help Center und MATLAB Answers

Community Treasure Hunt

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

Start Hunting!
Version Veröffentlicht Versionshinweise
1.0.0.0