Travel Guide (GridLess Based Djikstra Algorithm)

Player need to Define Map & 2 Points to get Shortest Distance.

Vous suivez désormais cette soumission

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).

Citation pour cette source

Krishna Lalith (2026). Travel Guide (GridLess Based Djikstra Algorithm) (https://fr.mathworks.com/matlabcentral/fileexchange/30707-travel-guide-gridless-based-djikstra-algorithm), MATLAB Central File Exchange. Extrait(e) le .

Informations générales

Compatibilité avec les versions de MATLAB

  • Compatible avec toutes les versions

Plateformes compatibles

  • Windows
  • macOS
  • Linux
Version Publié le Notes de version Action
1.0.0.0