विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| बेलमैन-फोर्ड एल्गोरिथम× | डिज्क्स्ट्रा एल्गोरिथम× | |
|---|---|---|
| क्षेत्र | संचालन अनुसंधान | संचालन अनुसंधान |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष | 1956 | 1956 |
| प्रवर्तक≠ | Richard Bellman and Lester R. Ford | Edsger W. Dijkstra |
| प्रकार | algorithm | algorithm |
| मौलिक स्रोत≠ | Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90. DOI ↗ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI ↗ |
| उपनाम | Bellman-Ford method, Bellman algorithm | Dijkstra's algorithm, shortest path algorithm |
| संबंधित | 3 | 3 |
| सारांश≠ | 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. | 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डेटासेट ↗ |
|
|