# Johnson's algorithm

> algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest

**Wikidata**: [Q2345824](https://www.wikidata.org/wiki/Q2345824)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Johnson's_algorithm)  
**Source**: https://4ort.xyz/entity/johnson-s-algorithm


## References

1. Freebase Data Dumps. 2013