Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Dijkstra-algoritmen× | Bellman-Fords algoritm× | |
|---|---|---|
| Ämnesområde | Operationsanalys | Operationsanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår | 1956 | 1956 |
| Upphovsperson≠ | Edsger W. Dijkstra | Richard Bellman and Lester R. Ford |
| Typ | algorithm | algorithm |
| Ursprungskälla≠ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI ↗ | Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90. DOI ↗ |
| Alias | Dijkstra's algorithm, shortest path algorithm | Bellman-Ford method, Bellman algorithm |
| Närliggande | 3 | 3 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|