Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Algorytm Dijkstry× | Algorytm wyszukiwania A*× | |
|---|---|---|
| Dziedzina | Badania operacyjne | Badania operacyjne |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1956 | 1968 |
| Twórca≠ | Edsger W. Dijkstra | Peter E. Hart, Nils J. Nilsson, and Bertram Raphael |
| Typ | algorithm | algorithm |
| Źródło pierwotne≠ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI ↗ | 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 ↗ |
| Inne nazwy≠ | Dijkstra's algorithm, shortest path algorithm | A* algorithm, A-star algorithm, A* search |
| Pokrewne≠ | 3 | 2 |
| Podsumowanie≠ | 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. | 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. |
| ScholarGateZbiór danych ↗ |
|
|