Rekod bukti kaedah

Ford-Fulkerson Algorithm

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.

Sources recorded, not reviewed

Rekod sumber

Petikan disalin secara verbatim daripada rekod sumber kaedah. Tiada pengesahan peringkat tuntutan disimpulkan daripadanya.

Ford-Fulkerson Algorithm for Maximum Flow

Rekod kaedah taksonomik · ml-model / operations-research

Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. · DOI 10.4153/CJM-1956-045-5
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. · ISBN 978-0-262-03384-8

Buka kaedah penuh

Tuntutan yang dikurasi

Tuntutan disimpan dalam lejar bukti, setiap satu dengan penilaiannya sendiri.

Tiada tuntutan terkurasi lagi

Pandangan ini tidak mencipta penilaian tuntutan apabila lejar tiada.

Kaedah berkaitan

Dijana daripada graf kaedah dan ditunjukkan sebagai perhubungan yang dicadangkan mesin — tiada tuntutan bukti disimpulkan.

Taxonomic bucketBellman-Ford Algorithmmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketDijkstra Algorithmmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketPush-Relabel Algorithmmachine-suggested · Relational suggestion, not evidence.Same method familySimplex Methodmachine-suggested · Relational suggestion, not evidence.