Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Algorithme de Bellman-Ford× | Algorithme de Dijkstra× | |
|---|---|---|
| Domaine | Recherche opérationnelle | Recherche opérationnelle |
| Famille | Machine learning | Machine learning |
| Année d'origine | 1956 | 1956 |
| Auteur d'origine≠ | Richard Bellman and Lester R. Ford | Edsger W. Dijkstra |
| Type | algorithm | algorithm |
| Source fondatrice≠ | Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90. DOI ↗ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI ↗ |
| Alias | Bellman-Ford method, Bellman algorithm | Dijkstra's algorithm, shortest path algorithm |
| Apparentées | 3 | 3 |
| Résumé≠ | 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. |
| ScholarGateJeu de données ↗ |
|
|