ขั้นตอนวิธีของเบลแมน-ฟอร์ด
Sign in to saveAlso known as Bellman–Ford–Moore algorithm, Bellman-Ford equation, distance-vector routing algorithm
algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
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
- Named after
- L. R. Ford, Jr.
- Image
- Bellman–Ford algorithm example.gif
Show 5 more facts
- discoverer or inventor
- Edward F. Moore
- derivative work
- Babel
- Commons category
- Bellman–Ford algorithm
Sources (2)
via Wikidata · CC0