Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Алгоритъм на Белман-Форд× | Алгоритъм на Форд-Фулкерсън× | |
|---|---|---|
| Област | Изследване на операциите | Изследване на операциите |
| Семейство | Machine learning | Machine learning |
| Година на възникване | 1956 | 1956 |
| Създател≠ | Richard Bellman and Lester R. Ford | Lester R. Ford and Delbert R. Fulkerson |
| Тип | algorithm | algorithm |
| Основополагащ източник≠ | Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90. DOI ↗ | Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. DOI ↗ |
| Други названия | Bellman-Ford method, Bellman algorithm | Ford-Fulkerson method, augmenting path method |
| Свързани≠ | 3 | 4 |
| Резюме≠ | 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. | 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. |
| ScholarGateНабор от данни ↗ |
|
|