השוואת שיטות

	אלגוריתם דייקסטרה	אלגוריתם בלמן-פורד
תחום	חקר ביצועים	חקר ביצועים
משפחה	Machine learning	Machine learning
שנת המקור	1956	1956
הוגה השיטה	Edsger W. Dijkstra	Richard Bellman and Lester R. Ford
סוג	algorithm	algorithm
מקור מכונן	Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271.	Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90.
כינויים	Dijkstra's algorithm, shortest path algorithm	Bellman-Ford method, Bellman algorithm
קשורות	3	3
תקציר	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.