# Floyd–Warshall algorithm

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

**Wikidata**: [Q1047576](https://www.wikidata.org/wiki/Q1047576)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Floyd–Warshall_algorithm)  
**Source**: https://4ort.xyz/entity/floyd-warshall-algorithm


## References

1. Freebase Data Dumps. 2013
2. [OpenAlex](https://docs.openalex.org/download-snapshot/snapshot-data-format)