Travel Guide (GridLess Based Djikstra Algorithm)
by Krishna Lalith
09 Mar 2011
Player need to Define Map & 2 Points to get Shortest Distance.
|
Watch this File
|
| File Information |
| Description |
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). |
| MATLAB release |
MATLAB 7.5 (R2007b)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Comments and Ratings (1) |
| 08 Oct 2011 |
Mr Smart
|
|
|
|
Contact us at files@mathworks.com