Comparer des méthodes

	Algorithme de recherche A*	Algorithme de Bellman-Ford	Algorithme de Dijkstra
Domaine	Recherche opérationnelle	Recherche opérationnelle	Recherche opérationnelle
Famille	Machine learning	Machine learning	Machine learning
Année d'origine	1968	1956	1956
Auteur d'origine	Peter E. Hart, Nils J. Nilsson, and Bertram Raphael	Richard Bellman and Lester R. Ford	Edsger W. Dijkstra
Type	algorithm	algorithm	algorithm
Source fondatrice	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.	Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90.	Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271.
Alias	A* algorithm, A-star algorithm, A* search	Bellman-Ford method, Bellman algorithm	Dijkstra's algorithm, shortest path algorithm
Apparentées	2	3	3
Résumé	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.	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.