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. 검색 날짜: .
| 버전 | 퍼블리시됨 | 릴리스 정보 | 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 |
