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 Dijkstra× | Algorithme de Ford-Fulkerson× | |
|---|---|---|
| Domaine | Recherche opérationnelle | Recherche opérationnelle |
| Famille | Machine learning | Machine learning |
| Année d'origine | 1956 | 1956 |
| Auteur d'origine≠ | Edsger W. Dijkstra | Lester R. Ford and Delbert R. Fulkerson |
| Type | algorithm | algorithm |
| Source fondatrice≠ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI ↗ | Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. DOI ↗ |
| Alias | Dijkstra's algorithm, shortest path algorithm | Ford-Fulkerson method, augmenting path method |
| Apparentées≠ | 3 | 4 |
| Résumé≠ | 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 Ford-Fulkerson Algorithm, developed by Lester R. Ford and Delbert R. Fulkerson in 1956, is a foundational method for computing the maximum flow in a flow network. It finds the maximum amount of flow that can be sent from a source to a sink through a directed graph with capacity constraints on edges. |
| ScholarGateJeu de données ↗ |
|
|