Category
Level
Bellman–Ford finds single-source shortest paths even when some edge weights are negative.