Bandingkan metode
Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.
| Algoritma Ford-Fulkerson× | Algoritma Bellman-Ford× | |
|---|---|---|
| Bidang | Riset Operasi | Riset Operasi |
| Keluarga | Machine learning | Machine learning |
| Tahun asal | 1956 | 1956 |
| Pencetus≠ | Lester R. Ford and Delbert R. Fulkerson | Richard Bellman and Lester R. Ford |
| Tipe | algorithm | algorithm |
| Sumber perintis≠ | Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. DOI ↗ | Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90. DOI ↗ |
| Alias | Ford-Fulkerson method, augmenting path method | Bellman-Ford method, Bellman algorithm |
| Terkait≠ | 4 | 3 |
| Ringkasan≠ | 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. | 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. |
| ScholarGateSet data ↗ |
|
|