KnowraBellman–Ford algorithmLinked fromLinked fromThe 4 pages that link to Bellman–Ford algorithm, each with the reason it gives.All 4Broader topic 1Related 1Compared with 2Shortest path problemRelated: Repeated edge relaxation handles negative weights that invalidate Dijkstra's algorithm.Dijkstra's algorithmCompared with: Unlike Dijkstra's algorithm, it remains valid when some edge weights are negative.Weighted graphBroader topic: It handles negative edge weights that Dijkstra's algorithm cannot generally accommodate.Floyd–Warshall algorithmCompared with: It handles negative weights from one source, while Floyd–Warshall computes all pairs.