قارن الطرق
راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.
| خوارزمية البحث A*× | خوارزمية بلمان-فورد× | |
|---|---|---|
| المجال | بحوث العمليات | بحوث العمليات |
| العائلة | Machine learning | Machine learning |
| سنة النشأة≠ | 1968 | 1956 |
| صاحب الطريقة≠ | Peter E. Hart, Nils J. Nilsson, and Bertram Raphael | Richard Bellman and Lester R. Ford |
| النوع | algorithm | algorithm |
| المصدر التأسيسي≠ | 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 ↗ | Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90. DOI ↗ |
| الأسماء البديلة≠ | A* algorithm, A-star algorithm, A* search | Bellman-Ford method, Bellman algorithm |
| ذات صلة≠ | 2 | 3 |
| الملخص≠ | 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. | The Bellman-Ford Algorithm, developed by Richard Bellman and Lester R. Ford in the 1950s, is a fundamental algorithm for computing shortest paths in weighted graphs that may contain negative edge weights. Unlike Dijkstra's algorithm, it correctly handles negative weights and can detect the presence of negative-weight cycles. |
| ScholarGateمجموعة البيانات ↗ |
|
|