Travel Guide (Points Based Djikstra Algorithm)
Player need to Define 2 Points to get Shortest Distance Path.
現在この提出コンテンツをフォロー中です。
- フォローしているコンテンツ フィードに更新が表示されます。
- コミュニケーション基本設定に応じて電子メールを受け取ることができます
Description of Game:
Objective: Shortest Distance Path between 2 Points.
Step: Select 2 Points to get Shortest Distance Path between them.
Intro: Background Image "Andhra Pradesh" is a state in India for which the major district Capitals (only) are defined.
Note 1: "Loop" is to view the possible Route Connection Definitions.
Note 2: "Travel" is used to Define 2 Points to view Optimum Path.
Note 3: The Route Definitions are based on the fact that each Point is connected with its Nearest 2 Points.
引用
Krishna Lalith (2026). Travel Guide (Points Based Djikstra Algorithm) (https://jp.mathworks.com/matlabcentral/fileexchange/30705-travel-guide-points-based-djikstra-algorithm), MATLAB Central File Exchange. に取得済み.
| バージョン | 公開済み | リリース ノート | Action |
|---|---|---|---|
| 1.0.0.0 |
