Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Ford-Fulkerson Algoritm× | Dijkstra-algoritmen× | |
|---|---|---|
| Ämnesområde | Operationsanalys | Operationsanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår | 1956 | 1956 |
| Upphovsperson≠ | Lester R. Ford and Delbert R. Fulkerson | Edsger W. Dijkstra |
| Typ | algorithm | algorithm |
| Ursprungskälla≠ | 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 ↗ |
| Alias | Ford-Fulkerson method, augmenting path method | Dijkstra's algorithm, shortest path algorithm |
| Närliggande≠ | 4 | 3 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|