Bellman–Ford algorithm

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Best-case performance

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

Class

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

Data structure

Graph

Worst-case performance

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

Worst-case space complexity

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