Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Algoritmul de Căutare A*× | Algoritmul lui Dijkstra× | |
|---|---|---|
| Domeniu | Cercetare operațională | Cercetare operațională |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1968 | 1956 |
| Autorul original≠ | Peter E. Hart, Nils J. Nilsson, and Bertram Raphael | Edsger W. Dijkstra |
| Tip | algorithm | algorithm |
| Sursa seminală≠ | Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107. DOI ↗ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI ↗ |
| Denumiri alternative≠ | A* algorithm, A-star algorithm, A* search | Dijkstra's algorithm, shortest path algorithm |
| Înrudite≠ | 2 | 3 |
| Rezumat≠ | The A* Search Algorithm, developed by Peter E. Hart, Nils J. Nilsson, and Bertram Raphael in 1968, is an optimal path-finding algorithm that combines the benefits of Dijkstra's algorithm with heuristic guidance. It efficiently finds the shortest path by balancing actual distance from the start with estimated distance to the goal. | Dijkstra's Algorithm, introduced by Edsger W. Dijkstra in 1956, is one of the most fundamental algorithms in computer science for solving the single-source shortest path problem. It finds the shortest path from a starting vertex to all other vertices in a weighted graph with non-negative edge weights. |
| ScholarGateSet de date ↗ |
|
|