File:Johnson's algorithm.svg
| Description | Johnson's algorithm for transforming a shortest path problem in a graph with negative edge weights into an equivalent problem with non-negative weights | ||
| Date | |||
| Source | Own work | ||
| Author | David Eppstein | ||
| Permission (Reusing this file) |
|
||
| Other versions | File:Johnson's algorithm pl.svg |