方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Ford-Fulkerson 算法× | 迪杰斯特拉算法× | |
|---|---|---|
| 领域 | 运筹学 | 运筹学 |
| 方法族 | Machine learning | Machine learning |
| 起源年份 | 1956 | 1956 |
| 提出者≠ | Lester R. Ford and Delbert R. Fulkerson | Edsger W. Dijkstra |
| 类型 | algorithm | algorithm |
| 开创性文献≠ | Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. DOI ↗ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI ↗ |
| 别名 | Ford-Fulkerson method, augmenting path method | Dijkstra's algorithm, shortest path algorithm |
| 相关≠ | 4 | 3 |
| 摘要≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|