الگوریتم بلمن–فورد

Key facts

Class

Single-source shortest path problem (for weighted directed graphs)

Data structure

Graph

Worst case performance

Θ ( | V | | E | ) {\displaystyle \Theta (|V||E|)}

Best case performance

Θ ( | E | ) {\displaystyle \Theta (|E|)}

Worst case space complexity

Θ ( | V | ) {\displaystyle \Theta (|V|)}

via Wikipedia infobox

Wikidata facts

Image

Bellman–Ford algorithm example.gif