# Bellman–Ford algorithm

> algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative

**Wikidata**: [Q816022](https://www.wikidata.org/wiki/Q816022)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Bellman–Ford_algorithm)  
**Source**: https://4ort.xyz/entity/bellman-ford-algorithm


## References

1. Freebase Data Dumps. 2013
2. RFC 2453: RIP Version 2
3. RFC 6126: The Babel Routing Protocol
4. [bellman-ford-algorithm · GitHub Topics · GitHub](https://github.com/topics/bellman-ford-algorithm)