Porównaj metody

	Algorytm Bellmana-Forda	Algorytm Dijkstry	Algorytm Forda-Fulkersona
Dziedzina	Badania operacyjne	Badania operacyjne	Badania operacyjne
Rodzina	Machine learning	Machine learning	Machine learning
Rok powstania	1956	1956	1956
Twórca	Richard Bellman and Lester R. Ford	Edsger W. Dijkstra	Lester R. Ford and Delbert R. Fulkerson
Typ	algorithm	algorithm	algorithm
Źródło pierwotne	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.	Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404.
Inne nazwy	Bellman-Ford method, Bellman algorithm	Dijkstra's algorithm, shortest path algorithm	Ford-Fulkerson method, augmenting path method
Pokrewne	3	3	4
Podsumowanie	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.	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.