In computer science is a computer algorithm that is widely used in pathfinding and graph traversal.
Ahora está siguiendo esta publicación
- Verá actualizaciones en las notificaciones de contenido en seguimiento.
- Podrá recibir correos electrónicos, en función de las preferencias de comunicación que haya establecido.
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.
Citar como
Duccio Mugnaini (2026). A Star Algorithm (https://github.com/ducciomugnaini/A-Star-Algorithm/releases/tag/1.2.0.1), GitHub. Recuperado .
Información general
- Versión 1.2.0.1 (448 KB)
-
Ver licencia en GitHub
Compatibilidad con la versión de MATLAB
- Compatible con cualquier versión
Compatibilidad con las plataformas
- Windows
- macOS
- Linux
| Versión | Publicado | Notas de la versión | 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 |
