In computer science is a computer algorithm that is widely used in pathfinding and graph traversal.
現在この提出コンテンツをフォロー中です。
- フォローしているコンテンツ フィードに更新が表示されます。
- コミュニケーション基本設定に応じて電子メールを受け取ることができます
In computer science is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between multiple points, called nodes. Noted for its performance and accuracy, it enjoys widespread use. However, in practical travel-routing systems, it is generally outperformed by algorithms which can pre-process the graph to attain better performance, although other work has found A* to be superior to other approaches.
引用
Duccio Mugnaini (2026). A Star Algorithm (https://github.com/ducciomugnaini/A-Star-Algorithm/releases/tag/1.2.0.1), GitHub. に取得済み.
一般的な情報
- バージョン 1.2.0.1 (448 KB)
-
GitHub でライセンスを表示
MATLAB リリースの互換性
- すべてのリリースと互換性あり
プラットフォームの互換性
- Windows
- macOS
- Linux
| バージョン | 公開済み | リリース ノート | Action |
|---|---|---|---|
| 1.2.0.1 | See release notes for this release on GitHub: https://github.com/ducciomugnaini/A-Star-Algorithm/releases/tag/1.2.0.1 |
||
| 1.2.0.0 | - |
||
| 1.1.0.0 | Classic string pulling algorithm is added;
|
||
| 1.0.0.0 | project pic example added |
