Travel Guide (GridLess Based Djikstra Algorithm)

Player need to Define Map & 2 Points to get Shortest Distance.
ダウンロード: 764
更新 2011/3/9

ライセンスの表示

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

引用

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. 取得済み .

MATLAB リリースの互換性
作成: R2007b
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linux
カテゴリ
Help Center および MATLAB AnswersGraph and Network Algorithms についてさらに検索

Community Treasure Hunt

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

Start Hunting!
バージョン 公開済み リリース ノート
1.0.0.0