Travel Guide (GridLess Based Djikstra Algorithm)

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


Updated 9 Mar 2011

View License

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

Cite As

Krishna Lalith (2023). Travel Guide (GridLess Based Djikstra Algorithm) (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2007b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers

Community Treasure Hunt

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

Start Hunting!
Version Published Release Notes